java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:09:16,276 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:09:16,278 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:09:16,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:09:16,300 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:09:16,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:09:16,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:09:16,308 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:09:16,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:09:16,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:09:16,319 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:09:16,320 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:09:16,323 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:09:16,325 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:09:16,328 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:09:16,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:09:16,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:09:16,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:09:16,340 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:09:16,343 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:09:16,344 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:09:16,346 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:09:16,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:09:16,351 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:09:16,351 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:09:16,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:09:16,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:09:16,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:09:16,359 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:09:16,362 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:09:16,362 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:09:16,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:09:16,364 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:09:16,364 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:09:16,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:09:16,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:09:16,367 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-20 10:09:16,388 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:09:16,389 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:09:16,389 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:09:16,390 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:09:16,390 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:09:16,390 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:09:16,391 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:09:16,391 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:09:16,391 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 10:09:16,391 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:09:16,392 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 10:09:16,392 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 10:09:16,392 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:09:16,392 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:09:16,394 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:09:16,394 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:09:16,394 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:09:16,395 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:09:16,395 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:09:16,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:09:16,395 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:09:16,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:09:16,396 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:09:16,397 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:09:16,398 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:09:16,398 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:09:16,398 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:09:16,398 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:09:16,398 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:09:16,399 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:09:16,399 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:09:16,399 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:09:16,399 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:09:16,399 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:09:16,400 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:09:16,400 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:09:16,400 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:09:16,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:09:16,400 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:09:16,401 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:09:16,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:09:16,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:09:16,455 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:09:16,456 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:09:16,457 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:09:16,458 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-01-20 10:09:16,458 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-01-20 10:09:16,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:09:16,516 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:09:16,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:09:16,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:09:16,517 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:09:16,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:16" (1/1) ... [2019-01-20 10:09:16,550 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:16" (1/1) ... [2019-01-20 10:09:16,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:09:16,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:09:16,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:09:16,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:09:16,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:16" (1/1) ... [2019-01-20 10:09:16,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:16" (1/1) ... [2019-01-20 10:09:16,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:16" (1/1) ... [2019-01-20 10:09:16,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:16" (1/1) ... [2019-01-20 10:09:16,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:16" (1/1) ... [2019-01-20 10:09:16,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:16" (1/1) ... [2019-01-20 10:09:16,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:16" (1/1) ... [2019-01-20 10:09:16,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:09:16,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:09:16,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:09:16,607 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:09:16,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:09:16,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:09:16,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:09:17,003 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:09:17,003 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-20 10:09:17,005 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:09:17 BoogieIcfgContainer [2019-01-20 10:09:17,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:09:17,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:09:17,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:09:17,010 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:09:17,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:09:16" (1/2) ... [2019-01-20 10:09:17,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ad73833 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:09:17, skipping insertion in model container [2019-01-20 10:09:17,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:09:17" (2/2) ... [2019-01-20 10:09:17,013 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-01-20 10:09:17,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:09:17,045 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-20 10:09:17,082 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-20 10:09:17,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:09:17,127 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:09:17,127 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:09:17,127 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:09:17,127 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:09:17,128 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:09:17,128 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:09:17,128 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:09:17,143 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-20 10:09:17,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:09:17,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:17,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:09:17,153 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:17,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-20 10:09:17,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:17,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:17,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:17,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:17,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:17,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:17,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:09:17,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:09:17,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:09:17,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:09:17,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:09:17,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:09:17,374 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-20 10:09:17,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:17,610 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-20 10:09:17,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:09:17,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:09:17,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:17,631 INFO L225 Difference]: With dead ends: 25 [2019-01-20 10:09:17,631 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:09:17,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:09:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:09:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-20 10:09:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 10:09:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-20 10:09:17,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-20 10:09:17,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:17,678 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-20 10:09:17,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:09:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-20 10:09:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:09:17,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:17,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:09:17,682 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:17,685 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-20 10:09:17,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:17,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:17,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:17,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:18,044 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2019-01-20 10:09:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:18,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:18,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:18,066 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:09:18,068 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-20 10:09:18,131 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:18,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:18,196 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:18,197 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:09:18,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:18,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:18,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:18,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:18,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:18,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:18,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:18,395 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-20 10:09:18,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:18,665 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-20 10:09:18,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:18,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:18,799 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:18,833 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:18,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:19,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:19,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:19,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:19,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:19,101 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,136 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,156 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,170 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,205 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:19,244 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:19,373 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-20 10:09:19,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:09:19,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:19,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-20 10:09:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:19,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:19,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:19,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:19,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:09:19,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:19,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:09:19,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:09:19,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:09:19,785 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-20 10:09:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:20,132 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-20 10:09:20,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:09:20,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:09:20,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:20,135 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:09:20,136 INFO L226 Difference]: Without dead ends: 37 [2019-01-20 10:09:20,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:09:20,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-20 10:09:20,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-20 10:09:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 10:09:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-20 10:09:20,143 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-20 10:09:20,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:20,143 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-20 10:09:20,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:09:20,143 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-20 10:09:20,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:09:20,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:20,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:09:20,145 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:20,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:20,145 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-20 10:09:20,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:20,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:20,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:20,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:20,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:20,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:20,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:20,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:20,287 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:09:20,287 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-20 10:09:20,289 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:20,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:20,364 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:20,365 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:09:20,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:20,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:20,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:20,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:20,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:20,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:20,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:20,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:20,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:20,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:20,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:20,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:20,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:20,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:20,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:20,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:20,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:20,553 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:20,575 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:20,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:20,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:20,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:20,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:20,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:20,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:20,685 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:20,718 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:20,743 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:20,763 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:20,774 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:20,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:20,835 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:20,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:20,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:09:20,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:09:21,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-20 10:09:21,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:199 [2019-01-20 10:09:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:21,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:21,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:09:21,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:09:21,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:09:21,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:09:21,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:09:21,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:09:21,328 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-20 10:09:21,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:21,382 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-20 10:09:21,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:09:21,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:09:21,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:21,386 INFO L225 Difference]: With dead ends: 18 [2019-01-20 10:09:21,386 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 10:09:21,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:09:21,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 10:09:21,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-20 10:09:21,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:09:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-20 10:09:21,392 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-20 10:09:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:21,392 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-20 10:09:21,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:09:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-20 10:09:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:09:21,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:21,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:09:21,393 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:21,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:21,394 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-20 10:09:21,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:21,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:21,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:21,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:21,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:21,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:09:21,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:09:21,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:09:21,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:09:21,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:09:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:09:21,445 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-20 10:09:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:21,496 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-20 10:09:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:09:21,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:09:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:21,498 INFO L225 Difference]: With dead ends: 21 [2019-01-20 10:09:21,498 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:09:21,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:09:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:09:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-20 10:09:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:09:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-20 10:09:21,505 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-20 10:09:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:21,505 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-20 10:09:21,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:09:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-20 10:09:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:09:21,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:21,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:09:21,506 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:21,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-20 10:09:21,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:21,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:21,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:21,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:21,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:21,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-01-20 10:09:21,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:21,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:21,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:09:21,567 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-20 10:09:21,568 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:21,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:21,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:21,574 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:09:21,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:21,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:21,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:21,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:21,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:21,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:21,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:21,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:21,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-01-20 10:09:21,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:21,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:21,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:21,715 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:21,740 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:21,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:21,838 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:21,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:21,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:21,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:21,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:21,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:21,965 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:21,979 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:21,993 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:22,017 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:22,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:09:22,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:22,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-20 10:09:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:22,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:22,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:22,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:09:22,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:22,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:09:22,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:09:22,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:09:22,133 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-20 10:09:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:22,288 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-20 10:09:22,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:09:22,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:09:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:22,292 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:09:22,292 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 10:09:22,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:09:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 10:09:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-20 10:09:22,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:09:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-20 10:09:22,298 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-20 10:09:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:22,298 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-20 10:09:22,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:09:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-20 10:09:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:22,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:22,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:22,299 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:22,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:22,299 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-20 10:09:22,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:22,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:22,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:22,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:22,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:22,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:22,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:22,376 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:22,376 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-20 10:09:22,378 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:22,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:22,385 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:22,385 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:22,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:22,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:22,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:22,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:22,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:22,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:22,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:22,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:22,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:22,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:22,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:22,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:22,615 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,640 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:22,861 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-20 10:09:22,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:22,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:22,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:22,901 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,912 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,921 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:22,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:22,944 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:23,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,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, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-20 10:09:23,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:09:23,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:09:23,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-01-20 10:09:23,442 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-20 10:09:23,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-20 10:09:23,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:09:23,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,796 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:23,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-20 10:09:23,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:23,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-20 10:09:23,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-01-20 10:09:26,028 WARN L181 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-01-20 10:09:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:26,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:26,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-01-20 10:09:26,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:26,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:26,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:26,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:26,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:26,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:26,212 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-20 10:09:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:26,755 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-01-20 10:09:26,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:09:26,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:09:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:26,758 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:09:26,758 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:09:26,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:09:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:09:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-01-20 10:09:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 10:09:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-01-20 10:09:26,766 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-01-20 10:09:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:26,766 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-01-20 10:09:26,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-01-20 10:09:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:26,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:26,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:26,767 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:26,768 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-20 10:09:26,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:26,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:26,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:26,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:26,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:26,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:26,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:26,845 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:26,846 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-20 10:09:26,848 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:26,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:26,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:26,857 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:09:26,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:26,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:26,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:26,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:26,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:26,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:26,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:26,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:26,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:26,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-01-20 10:09:26,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:26,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:26,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:09:26,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:26,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:26,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:26,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:09:26,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:09:26,968 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:26,984 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:26,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,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 26 treesize of output 25 [2019-01-20 10:09:27,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:09:27,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:09:27,214 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,220 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,228 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:27,247 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-20 10:09:27,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-20 10:09:27,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:27,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-20 10:09:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:27,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:27,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:27,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:09:27,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-20 10:09:27,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:09:27,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:09:27,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:09:27,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:09:27,358 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-01-20 10:09:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:27,450 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-01-20 10:09:27,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:09:27,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:09:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:27,452 INFO L225 Difference]: With dead ends: 25 [2019-01-20 10:09:27,452 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 10:09:27,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:09:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 10:09:27,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-20 10:09:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:09:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-01-20 10:09:27,470 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-01-20 10:09:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:27,470 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-01-20 10:09:27,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:09:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-01-20 10:09:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:27,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:27,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:27,472 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-20 10:09:27,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:27,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:27,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:27,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:27,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:27,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:27,617 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:27,617 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-20 10:09:27,619 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:27,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:27,625 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:27,625 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:27,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:27,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:27,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:27,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:27,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:27,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:27,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:27,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:27,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:27,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:27,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:27,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:27,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:27,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,723 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:27,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:27,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:27,865 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,873 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,882 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:27,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:27,905 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:27,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:27,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:09:27,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:28,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:09:28,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,053 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:28,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-20 10:09:28,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:28,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-20 10:09:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:28,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:28,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:28,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:28,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:28,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:28,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:28,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:28,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:28,202 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-01-20 10:09:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:28,644 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-01-20 10:09:28,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:09:28,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:09:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:28,649 INFO L225 Difference]: With dead ends: 56 [2019-01-20 10:09:28,649 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:09:28,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:09:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-01-20 10:09:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 10:09:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-01-20 10:09:28,657 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-01-20 10:09:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:28,657 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-01-20 10:09:28,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-01-20 10:09:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:28,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:28,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:28,659 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:28,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:28,659 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-01-20 10:09:28,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:28,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:28,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:28,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:28,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:28,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:28,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:28,752 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:28,752 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-01-20 10:09:28,754 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:28,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:28,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:28,759 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:28,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:28,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:28,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:28,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:28,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:28,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:28,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:28,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:28,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:28,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:28,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:28,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:28,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:28,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:28,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:28,936 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,954 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,975 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,988 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,999 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:29,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:29,024 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:29,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:09:29,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:29,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:29,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:09:29,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:09:29,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:29,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:29,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:09:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:29,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:29,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:29,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:29,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:29,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:29,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:29,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:29,244 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-01-20 10:09:29,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:29,582 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-01-20 10:09:29,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:09:29,582 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:09:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:29,583 INFO L225 Difference]: With dead ends: 52 [2019-01-20 10:09:29,583 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 10:09:29,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:29,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 10:09:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-20 10:09:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 10:09:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-20 10:09:29,592 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-20 10:09:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:29,592 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-20 10:09:29,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-20 10:09:29,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:29,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:29,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:29,594 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:29,594 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-20 10:09:29,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:29,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:29,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:29,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:29,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:29,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:29,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:29,674 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:29,674 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-20 10:09:29,678 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:29,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:29,683 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:29,683 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:09:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:29,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:29,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:29,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:29,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:29,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:29,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:29,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:29,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:09:29,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:09:29,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:09:29,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:09:29,756 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:29,814 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:29,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:29,838 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:29,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:29,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:09:29,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:09:29,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:09:29,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:29,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:09:29,971 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:29,986 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,001 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,017 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:30,046 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:09:30,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:09:30,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:30,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-20 10:09:30,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:30,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:30,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:30,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:09:30,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:30,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:09:30,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:09:30,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:09:30,225 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-01-20 10:09:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:30,371 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-01-20 10:09:30,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:09:30,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:09:30,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:30,372 INFO L225 Difference]: With dead ends: 42 [2019-01-20 10:09:30,372 INFO L226 Difference]: Without dead ends: 41 [2019-01-20 10:09:30,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:09:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-20 10:09:30,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-01-20 10:09:30,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 10:09:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-20 10:09:30,380 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-20 10:09:30,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:30,380 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-20 10:09:30,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:09:30,380 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-20 10:09:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:30,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:30,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:30,381 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:30,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:30,381 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-20 10:09:30,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:30,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:30,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:30,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:30,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:30,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:30,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:30,473 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:30,473 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-20 10:09:30,476 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:30,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:30,480 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:30,481 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:30,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:30,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:30,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:30,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:30,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:30,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:30,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:30,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-01-20 10:09:30,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:30,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:30,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:09:30,584 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,626 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,655 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:09:30,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:09:30,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:09:30,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:30,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:09:30,915 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,951 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,967 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:30,984 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:31,019 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-20 10:09:31,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:09:31,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:31,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:09:31,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:09:31,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:31,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-20 10:09:31,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:31,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:31,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:31,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:31,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:31,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:31,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:31,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:31,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:31,200 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-01-20 10:09:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:31,554 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-01-20 10:09:31,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:09:31,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:09:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:31,556 INFO L225 Difference]: With dead ends: 54 [2019-01-20 10:09:31,556 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 10:09:31,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 10:09:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-01-20 10:09:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-20 10:09:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-01-20 10:09:31,566 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-01-20 10:09:31,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:31,566 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-01-20 10:09:31,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-01-20 10:09:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:31,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:31,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:31,567 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:31,567 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-01-20 10:09:31,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:31,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:31,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:31,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:31,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:31,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:31,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:31,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:31,657 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-20 10:09:31,658 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:31,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:31,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:31,662 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:31,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:31,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:31,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:31,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:31,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:31,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:31,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:31,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:31,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:31,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:31,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:31,768 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:31,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:31,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:31,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:31,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:31,833 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,850 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,863 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,874 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,883 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:31,905 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:31,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:09:31,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:31,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:09:31,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:31,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:09:31,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:31,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:31,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-20 10:09:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:32,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:32,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:32,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:09:32,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:32,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:32,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:32,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:09:32,052 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-01-20 10:09:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:32,342 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-01-20 10:09:32,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:09:32,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:09:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:32,343 INFO L225 Difference]: With dead ends: 63 [2019-01-20 10:09:32,343 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 10:09:32,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:09:32,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 10:09:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-01-20 10:09:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:09:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-01-20 10:09:32,354 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-01-20 10:09:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:32,354 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-01-20 10:09:32,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-01-20 10:09:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:32,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:32,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:32,355 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:32,356 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-20 10:09:32,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:32,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:32,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:32,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:32,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:09:32,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:09:32,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:09:32,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:09:32,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:09:32,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:09:32,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:09:32,401 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-01-20 10:09:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:32,510 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-01-20 10:09:32,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:09:32,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:09:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:32,511 INFO L225 Difference]: With dead ends: 41 [2019-01-20 10:09:32,512 INFO L226 Difference]: Without dead ends: 40 [2019-01-20 10:09:32,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:09:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-20 10:09:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-01-20 10:09:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 10:09:32,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-01-20 10:09:32,521 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-01-20 10:09:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:32,521 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-01-20 10:09:32,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:09:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-01-20 10:09:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:32,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:32,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:32,522 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:32,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:32,522 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-01-20 10:09:32,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:32,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:32,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:32,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:32,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:32,639 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:32,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:32,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:32,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:32,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:32,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:32,640 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:32,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:32,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:32,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:09:32,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:32,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:32,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:32,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:32,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:32,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:32,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:09:32,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:32,780 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:32,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:32,807 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:32,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:32,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:09:32,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:09:32,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:32,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:09:33,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:09:33,018 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,033 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,048 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,064 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:33,094 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-20 10:09:33,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:09:33,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:33,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:09:33,374 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-20 10:09:33,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,553 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:33,553 INFO L303 Elim1Store]: Index analysis took 175 ms [2019-01-20 10:09:33,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-01-20 10:09:33,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:33,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-01-20 10:09:33,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:33,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:33,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:33,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:33,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:33,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:33,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:33,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:33,752 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-01-20 10:09:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:34,119 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-01-20 10:09:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:09:34,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:09:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:34,120 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:09:34,120 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:09:34,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:09:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-01-20 10:09:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 10:09:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-01-20 10:09:34,132 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-01-20 10:09:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:34,132 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-01-20 10:09:34,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-01-20 10:09:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:34,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:34,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:34,133 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:34,133 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-20 10:09:34,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:34,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:34,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:34,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:34,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:34,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:34,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:34,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:34,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:34,195 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-20 10:09:34,196 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:34,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:34,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:34,200 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:34,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:34,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:34,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:34,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:34,211 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:34,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:34,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:34,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:34,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:34,308 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:34,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:34,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:34,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:34,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:34,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:34,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:34,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:34,406 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:34,426 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:34,439 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:34,450 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:34,459 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:34,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:34,480 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:34,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:09:34,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:34,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:34,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-20 10:09:34,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:34,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:09:34,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:34,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-01-20 10:09:34,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:09:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:34,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:34,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:34,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:09:34,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:34,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:09:34,722 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-01-20 10:09:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:35,049 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-01-20 10:09:35,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:09:35,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:09:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:35,051 INFO L225 Difference]: With dead ends: 61 [2019-01-20 10:09:35,051 INFO L226 Difference]: Without dead ends: 60 [2019-01-20 10:09:35,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-20 10:09:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-01-20 10:09:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 10:09:35,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-01-20 10:09:35,063 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-01-20 10:09:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:35,063 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-01-20 10:09:35,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-01-20 10:09:35,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:35,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:35,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:35,064 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:35,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:35,065 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-20 10:09:35,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:35,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:35,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:35,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:35,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-01-20 10:09:35,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:35,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:35,129 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:35,129 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-20 10:09:35,132 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:35,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:35,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:35,136 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:09:35,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:35,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:35,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:35,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:35,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:35,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:35,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:35,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:35,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:09:35,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:09:35,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:09:35,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:09:35,218 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:35,244 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:35,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:35,265 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:35,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:35,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:09:35,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:09:35,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:09:35,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:09:35,420 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:35,433 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:35,447 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:35,462 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:35,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:35,548 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:09:35,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:35,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:09:35,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:35,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:35,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-20 10:09:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:35,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:35,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:35,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:09:35,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:35,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:09:35,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:09:35,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:09:35,647 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-01-20 10:09:36,176 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-20 10:09:36,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:36,323 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-01-20 10:09:36,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:09:36,323 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:09:36,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:36,324 INFO L225 Difference]: With dead ends: 53 [2019-01-20 10:09:36,324 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 10:09:36,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:09:36,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 10:09:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-01-20 10:09:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 10:09:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-01-20 10:09:36,337 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-01-20 10:09:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:36,337 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-01-20 10:09:36,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:09:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-01-20 10:09:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:09:36,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:36,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:09:36,338 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:36,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:36,339 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-20 10:09:36,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:36,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:36,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:36,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:36,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:36,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:36,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:36,482 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:09:36,482 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-20 10:09:36,483 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:36,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:36,487 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:36,487 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:36,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:36,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:36,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:36,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:36,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:36,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:36,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:36,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:36,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-01-20 10:09:36,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:36,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:36,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:09:36,560 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:36,587 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:36,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:36,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:36,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:36,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:09:36,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:09:36,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:09:36,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:09:36,798 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:36,818 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:36,834 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:36,849 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:36,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:36,921 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-20 10:09:36,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:36,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:09:36,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:36,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:36,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:09:37,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:09:37,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:37,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:37,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-20 10:09:37,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:37,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:37,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:37,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:37,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:37,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:37,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:37,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:37,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:37,142 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-01-20 10:09:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:37,667 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-01-20 10:09:37,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:09:37,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:09:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:37,669 INFO L225 Difference]: With dead ends: 69 [2019-01-20 10:09:37,669 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 10:09:37,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 10:09:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-01-20 10:09:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 10:09:37,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-01-20 10:09:37,681 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-01-20 10:09:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:37,682 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-01-20 10:09:37,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:37,682 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-01-20 10:09:37,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:37,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:37,683 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-20 10:09:37,683 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:37,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:37,683 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-01-20 10:09:37,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:37,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:37,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:09:37,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:37,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:37,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:37,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:37,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:37,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:37,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:37,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:37,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:09:37,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:37,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:37,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:37,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:37,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:37,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:37,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:37,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:09:37,895 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,092 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:09:38,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:09:38,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:09:38,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:09:38,314 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,333 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,350 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,367 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:38,400 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-01-20 10:09:38,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:09:38,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:38,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:09:38,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-01-20 10:09:38,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:38,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-01-20 10:09:38,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:09:38,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:38,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-20 10:09:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:38,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:38,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:38,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-20 10:09:38,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:38,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:09:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:09:38,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:09:38,642 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-01-20 10:09:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:38,978 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-01-20 10:09:38,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:09:38,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-20 10:09:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:38,980 INFO L225 Difference]: With dead ends: 73 [2019-01-20 10:09:38,980 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:09:38,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:09:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-01-20 10:09:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-20 10:09:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-01-20 10:09:38,995 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-01-20 10:09:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:38,995 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-01-20 10:09:38,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:09:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-01-20 10:09:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:38,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:38,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:09:38,996 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:38,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:38,997 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-20 10:09:38,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:38,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:38,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:38,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:38,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:39,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:39,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:39,105 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:09:39,105 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-20 10:09:39,106 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:39,107 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:39,109 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:39,109 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:39,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:39,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:39,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:39,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:39,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:39,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:39,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:39,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:39,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:09:39,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:09:39,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:09:39,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:09:39,202 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,227 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,249 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:09:39,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:09:39,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:09:39,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:09:39,373 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,388 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,402 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,418 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:39,445 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:09:39,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:09:39,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:39,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:09:39,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:39,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-20 10:09:39,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:39,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:39,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-01-20 10:09:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:39,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:39,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:39,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:09:39,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:39,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:39,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:39,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:09:39,694 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-01-20 10:09:40,107 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-20 10:09:40,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:40,306 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-01-20 10:09:40,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:09:40,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:09:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:40,308 INFO L225 Difference]: With dead ends: 84 [2019-01-20 10:09:40,308 INFO L226 Difference]: Without dead ends: 78 [2019-01-20 10:09:40,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:09:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-20 10:09:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-01-20 10:09:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-20 10:09:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-01-20 10:09:40,326 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-01-20 10:09:40,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:40,326 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-01-20 10:09:40,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-01-20 10:09:40,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:40,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:40,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:09:40,328 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:40,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:40,328 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-20 10:09:40,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:40,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:40,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:40,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:40,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:40,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:40,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:40,478 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:09:40,479 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-20 10:09:40,482 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:40,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:40,487 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:40,487 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:09:40,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:40,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:40,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:40,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:40,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:40,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:40,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:40,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:40,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:40,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:40,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:40,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:40,546 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,564 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,597 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:40,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:40,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:40,715 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,731 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,739 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:40,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:40,760 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:40,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:40,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-20 10:09:40,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:09:40,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:09:40,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-01-20 10:09:41,437 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-20 10:09:41,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:41,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:41,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:41,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:41,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:41,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:41,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:41,745 INFO L303 Elim1Store]: Index analysis took 302 ms [2019-01-20 10:09:42,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-20 10:09:42,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:09:42,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,576 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:42,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-20 10:09:42,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:42,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-20 10:09:42,693 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-01-20 10:09:42,819 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-01-20 10:09:42,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,880 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:42,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 86 [2019-01-20 10:09:42,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:42,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:42,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-01-20 10:09:42,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,051 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:43,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-20 10:09:43,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,138 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:43,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-20 10:09:43,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-20 10:09:43,204 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-01-20 10:09:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:43,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:43,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:09:43,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:43,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:09:43,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:09:43,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:09:43,365 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-01-20 10:09:46,037 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-01-20 10:09:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:46,270 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-01-20 10:09:46,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:09:46,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:09:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:46,272 INFO L225 Difference]: With dead ends: 109 [2019-01-20 10:09:46,272 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 10:09:46,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=115, Invalid=226, Unknown=1, NotChecked=0, Total=342 [2019-01-20 10:09:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 10:09:46,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-01-20 10:09:46,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 10:09:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-01-20 10:09:46,292 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-01-20 10:09:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:46,292 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-01-20 10:09:46,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:09:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-01-20 10:09:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:46,293 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:46,293 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:09:46,294 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-20 10:09:46,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:46,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:46,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:46,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:46,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:09:46,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:46,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:46,368 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:09:46,368 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-20 10:09:46,370 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:46,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:46,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:46,374 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:46,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:46,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:46,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:46,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:46,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:46,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:46,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:46,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:46,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:46,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:46,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:46,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:46,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,468 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:46,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:46,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:46,595 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,605 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,614 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:46,636 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:46,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:09:46,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:46,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:09:46,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:46,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:09:46,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:46,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:46,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-20 10:09:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:46,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:46,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:46,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:46,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:46,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:46,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:46,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:46,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:46,873 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-01-20 10:09:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:47,215 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-01-20 10:09:47,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:09:47,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:09:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:47,217 INFO L225 Difference]: With dead ends: 77 [2019-01-20 10:09:47,217 INFO L226 Difference]: Without dead ends: 76 [2019-01-20 10:09:47,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:09:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-20 10:09:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-20 10:09:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 10:09:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-01-20 10:09:47,235 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-01-20 10:09:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:47,235 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-01-20 10:09:47,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-01-20 10:09:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:47,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:47,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:09:47,236 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:47,237 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-01-20 10:09:47,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:47,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:47,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:47,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:47,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:47,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:47,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:47,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:47,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:47,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:47,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:47,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:47,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:09:47,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:47,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:47,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:09:47,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:09:47,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:09:47,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:09:47,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:47,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:47,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:47,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:47,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:09:47,606 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,630 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,643 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,654 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,664 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:47,695 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:09:47,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:09:47,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:47,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:09:47,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,784 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:47,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:09:47,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:47,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-20 10:09:47,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:47,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-01-20 10:09:47,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:47,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:47,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-20 10:09:47,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:47,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:47,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:47,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:47,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:09:47,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:47,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:09:47,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:09:47,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:47,967 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-01-20 10:09:48,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:48,480 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-01-20 10:09:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:09:48,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:09:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:48,486 INFO L225 Difference]: With dead ends: 88 [2019-01-20 10:09:48,486 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 10:09:48,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:09:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 10:09:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-01-20 10:09:48,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:09:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-20 10:09:48,505 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-20 10:09:48,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:48,505 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-20 10:09:48,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:09:48,505 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-20 10:09:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:48,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:48,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:09:48,506 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:48,506 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-20 10:09:48,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:48,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:48,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:48,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:48,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:48,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:48,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:48,774 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:09:48,774 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-20 10:09:48,775 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:48,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:48,778 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:48,778 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:48,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:48,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:48,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:48,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:48,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:48,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:48,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:48,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:48,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:09:48,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:09:48,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:09:48,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:09:48,848 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:48,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:48,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:48,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:48,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:48,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:09:48,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:09:48,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:48,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:09:48,962 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:48,970 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:48,979 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:48,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:48,999 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-20 10:09:49,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:09:49,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:49,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:09:49,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:09:49,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:49,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-20 10:09:49,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:49,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:49,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:49,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:49,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:49,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:49,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:49,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:49,153 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-01-20 10:09:49,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:49,410 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-01-20 10:09:49,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:09:49,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:09:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:49,412 INFO L225 Difference]: With dead ends: 81 [2019-01-20 10:09:49,412 INFO L226 Difference]: Without dead ends: 80 [2019-01-20 10:09:49,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-20 10:09:49,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-01-20 10:09:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:09:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-20 10:09:49,428 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-20 10:09:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:49,428 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-20 10:09:49,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-20 10:09:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:49,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:49,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:09:49,429 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:49,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:49,429 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-20 10:09:49,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:49,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:49,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:49,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:49,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:49,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:49,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:49,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:09:49,599 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-20 10:09:49,600 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:49,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:49,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:49,603 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:09:49,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:49,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:49,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:49,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:49,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:49,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:49,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:49,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:49,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:49,817 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-20 10:09:49,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:49,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:49,858 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:49,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:49,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:49,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:49,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:49,908 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,926 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,939 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,950 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,959 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:49,981 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:50,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:09:50,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:50,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:50,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:09:50,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:09:50,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:50,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:50,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:09:50,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,128 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:50,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-20 10:09:50,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:50,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:50,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:09:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:50,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:50,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:50,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:09:50,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:50,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:09:50,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:09:50,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:50,242 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-01-20 10:09:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:50,740 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-01-20 10:09:50,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:09:50,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:09:50,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:50,742 INFO L225 Difference]: With dead ends: 113 [2019-01-20 10:09:50,743 INFO L226 Difference]: Without dead ends: 112 [2019-01-20 10:09:50,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:09:50,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-20 10:09:50,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-01-20 10:09:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-20 10:09:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-01-20 10:09:50,766 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-01-20 10:09:50,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:50,767 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-01-20 10:09:50,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:09:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-01-20 10:09:50,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:50,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:50,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:09:50,768 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:50,768 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-01-20 10:09:50,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:50,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:50,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:50,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:50,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:50,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:50,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:50,874 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:09:50,875 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-01-20 10:09:50,878 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:50,878 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:50,881 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:50,884 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:09:50,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:50,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:50,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:50,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:50,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:50,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:50,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:50,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:50,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:50,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:50,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:50,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:50,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:50,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:50,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:51,009 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:51,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:51,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:51,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:51,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:51,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:51,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:51,200 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:51,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:51,230 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:51,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:51,258 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:51,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:09:51,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:09:51,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-20 10:09:51,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-01-20 10:09:51,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2019-01-20 10:09:51,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:51,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,835 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:51,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-20 10:09:51,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:51,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:51,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 73 [2019-01-20 10:09:51,901 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:51,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:09:51,964 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:138, output treesize:96 [2019-01-20 10:09:52,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,030 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:52,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-20 10:09:52,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:52,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-01-20 10:09:52,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:52,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:52,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-20 10:09:52,174 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:52,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:09:52,228 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-01-20 10:09:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:52,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:52,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:52,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-20 10:09:52,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:52,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:09:52,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:09:52,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:09:52,352 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-01-20 10:09:52,694 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 26 [2019-01-20 10:09:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:53,388 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-01-20 10:09:53,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:09:53,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:09:53,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:53,391 INFO L225 Difference]: With dead ends: 137 [2019-01-20 10:09:53,391 INFO L226 Difference]: Without dead ends: 136 [2019-01-20 10:09:53,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:09:53,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-20 10:09:53,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-20 10:09:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 10:09:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-01-20 10:09:53,422 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-01-20 10:09:53,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:53,423 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-01-20 10:09:53,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:09:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-01-20 10:09:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:53,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:53,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:09:53,424 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:53,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:53,424 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-20 10:09:53,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:53,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:53,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:53,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:53,425 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:09:53,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:53,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:53,508 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:09:53,508 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-20 10:09:53,509 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:53,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:53,513 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:53,513 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:53,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:53,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:53,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:53,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:53,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:53,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:53,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:53,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:09:53,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:09:53,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:09:53,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:09:53,715 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:53,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:53,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:53,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:53,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:53,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:53,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:53,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:53,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-01-20 10:09:53,802 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:53,825 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:53,839 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:53,851 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:53,860 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:53,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:53,891 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-20 10:09:53,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:09:53,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:53,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:53,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:09:53,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:53,988 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:53,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:09:53,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:54,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-20 10:09:54,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:54,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:54,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-01-20 10:09:54,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:54,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:54,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:54,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:54,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:54,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:54,142 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-01-20 10:09:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:54,460 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-01-20 10:09:54,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:09:54,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:09:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:54,463 INFO L225 Difference]: With dead ends: 120 [2019-01-20 10:09:54,463 INFO L226 Difference]: Without dead ends: 119 [2019-01-20 10:09:54,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-20 10:09:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-01-20 10:09:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-20 10:09:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-01-20 10:09:54,505 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-01-20 10:09:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:54,505 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-01-20 10:09:54,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-01-20 10:09:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:54,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:54,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:09:54,506 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:54,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-20 10:09:54,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:54,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:54,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:54,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:54,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:54,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:54,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:54,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:54,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:09:54,568 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-20 10:09:54,569 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:54,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:54,573 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:54,573 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:09:54,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:54,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:54,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:54,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:54,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:54,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:54,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:54,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:54,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:09:54,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:09:54,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:09:54,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:09:54,625 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,651 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,675 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:09:54,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:09:54,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:09:54,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:09:54,800 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,813 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,828 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,844 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:54,873 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:09:54,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:09:54,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:55,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:55,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-20 10:09:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:55,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:55,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:55,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:09:55,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:09:55,050 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:09:55,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:09:55,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:09:55,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:09:55,050 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-01-20 10:09:55,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:55,177 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-01-20 10:09:55,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:09:55,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:09:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:55,179 INFO L225 Difference]: With dead ends: 105 [2019-01-20 10:09:55,179 INFO L226 Difference]: Without dead ends: 104 [2019-01-20 10:09:55,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:09:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-20 10:09:55,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-20 10:09:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-20 10:09:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-01-20 10:09:55,225 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-01-20 10:09:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:55,225 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-01-20 10:09:55,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:09:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-01-20 10:09:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:55,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:55,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:09:55,226 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:55,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:55,227 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-01-20 10:09:55,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:55,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:55,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:55,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:55,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:55,764 WARN L181 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-20 10:09:56,225 WARN L181 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-20 10:09:56,427 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:09:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:56,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:56,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:56,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:56,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:56,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:56,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:56,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:09:56,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:09:56,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:09:56,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:56,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:56,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:56,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:09:56,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:09:56,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:09:56,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:09:56,705 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,721 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:09:56,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:09:56,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:56,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:09:56,918 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,927 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,937 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:56,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:56,958 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:09:56,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:09:57,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:09:57,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-20 10:09:57,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:199 [2019-01-20 10:09:57,328 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-01-20 10:09:57,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2019-01-20 10:09:57,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:57,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,467 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:57,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-20 10:09:57,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:57,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-20 10:09:57,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:57,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-20 10:09:57,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:57,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-20 10:09:57,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:181, output treesize:121 [2019-01-20 10:09:57,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,827 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:57,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-01-20 10:09:57,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:57,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2019-01-20 10:09:57,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:57,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:57,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,004 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:58,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 37 treesize of output 73 [2019-01-20 10:09:58,005 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,090 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:58,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-20 10:09:58,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-20 10:09:58,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-01-20 10:09:58,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-01-20 10:09:58,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:58,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:58,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:09:58,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:58,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:09:58,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:09:58,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:58,298 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-01-20 10:09:58,673 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-20 10:09:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:58,998 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-01-20 10:09:58,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:09:58,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:09:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:59,001 INFO L225 Difference]: With dead ends: 131 [2019-01-20 10:09:59,001 INFO L226 Difference]: Without dead ends: 130 [2019-01-20 10:09:59,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:09:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-20 10:09:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-01-20 10:09:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:09:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-01-20 10:09:59,022 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-01-20 10:09:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:59,022 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-01-20 10:09:59,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:09:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-01-20 10:09:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:09:59,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:59,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:09:59,023 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:59,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:59,023 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-20 10:09:59,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:59,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:59,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:59,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:59,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:59,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-01-20 10:09:59,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:59,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:59,178 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:09:59,178 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-20 10:09:59,180 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:59,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:59,182 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:59,183 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:59,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:59,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:59,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:59,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:59,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:59,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:59,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:59,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:59,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:09:59,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:09:59,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:09:59,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:09:59,225 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,271 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:09:59,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:09:59,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,486 INFO L303 Elim1Store]: Index analysis took 138 ms [2019-01-20 10:09:59,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:09:59,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:09:59,585 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,599 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,613 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,629 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:59,657 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:09:59,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:09:59,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:59,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:09:59,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:59,808 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:59,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2019-01-20 10:09:59,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:59,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:09:59,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-20 10:09:59,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:59,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:59,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:59,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:59,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:09:59,947 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:59,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:59,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:59,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:09:59,948 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-01-20 10:10:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:00,421 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-01-20 10:10:00,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:00,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:10:00,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:00,422 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:10:00,423 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 10:10:00,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:10:00,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 10:10:00,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-01-20 10:10:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-20 10:10:00,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-01-20 10:10:00,446 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-01-20 10:10:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:00,446 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-01-20 10:10:00,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-01-20 10:10:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:00,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:00,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:00,447 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:00,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-20 10:10:00,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:00,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:00,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:00,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:00,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:00,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:00,663 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:00,664 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-20 10:10:00,664 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:00,665 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:00,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:00,668 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:00,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:00,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:00,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:00,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:00,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:00,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:00,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:10:00,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:10:00,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:10:00,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,773 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:00,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:10:00,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:10:00,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:10:00,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:10:00,813 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,831 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,844 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,855 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:00,886 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-20 10:10:00,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:10:00,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:00,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-20 10:10:00,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:00,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-20 10:10:00,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:00,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:00,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-20 10:10:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:00,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:01,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:01,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:10:01,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:01,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:01,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:01,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:01,023 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-01-20 10:10:01,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:01,305 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-01-20 10:10:01,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:01,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:10:01,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:01,306 INFO L225 Difference]: With dead ends: 73 [2019-01-20 10:10:01,306 INFO L226 Difference]: Without dead ends: 72 [2019-01-20 10:10:01,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:10:01,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-20 10:10:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-01-20 10:10:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 10:10:01,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-01-20 10:10:01,331 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-01-20 10:10:01,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:01,331 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-01-20 10:10:01,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:01,331 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-01-20 10:10:01,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:01,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:01,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:01,332 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:01,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:01,332 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-20 10:10:01,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:01,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:01,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:01,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:01,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:01,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:01,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:01,443 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:01,443 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-20 10:10:01,443 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:01,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:01,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:01,447 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:01,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:01,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:01,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:01,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:01,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:01,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:01,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:01,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:01,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:10:01,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:10:01,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:10:01,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:10:01,520 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,553 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:10:01,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:10:01,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:10:01,713 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,723 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,732 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:01,753 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:10:01,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:10:01,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:01,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:10:01,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,834 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:01,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:10:01,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:01,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-20 10:10:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:01,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:01,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:01,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:01,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-20 10:10:01,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:01,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:10:01,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:10:01,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:10:01,926 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-01-20 10:10:02,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:02,156 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-20 10:10:02,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:02,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-20 10:10:02,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:02,158 INFO L225 Difference]: With dead ends: 66 [2019-01-20 10:10:02,158 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 10:10:02,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:02,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 10:10:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-01-20 10:10:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-20 10:10:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-01-20 10:10:02,197 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-01-20 10:10:02,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:02,197 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-01-20 10:10:02,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:10:02,197 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-01-20 10:10:02,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:02,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:02,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:02,198 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:02,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:02,198 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-20 10:10:02,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:02,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:02,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:02,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:02,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:02,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:10:02,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:10:02,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:02,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:10:02,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:10:02,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:10:02,268 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-01-20 10:10:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:02,336 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-01-20 10:10:02,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:10:02,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:10:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:02,338 INFO L225 Difference]: With dead ends: 54 [2019-01-20 10:10:02,338 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 10:10:02,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:10:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 10:10:02,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-20 10:10:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 10:10:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-01-20 10:10:02,365 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-01-20 10:10:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:02,365 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-01-20 10:10:02,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:10:02,365 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-01-20 10:10:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:10:02,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:02,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:10:02,366 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:02,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:02,366 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-01-20 10:10:02,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:02,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:02,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:02,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:02,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:02,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:02,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:02,459 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:10:02,459 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-20 10:10:02,460 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:02,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:02,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:02,463 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:02,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:02,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:02,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:02,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:02,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:02,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:02,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:02,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:10:02,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:10:02,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:10:02,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,532 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:02,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:02,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:02,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:02,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:10:02,572 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,588 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,601 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,611 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,621 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:02,640 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-20 10:10:02,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,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 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:10:02,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:02,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:10:02,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-01-20 10:10:02,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:02,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:10:02,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:02,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:02,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-20 10:10:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:02,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:02,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:02,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:10:02,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:02,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:02,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:02,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:02,877 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-01-20 10:10:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:03,114 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-01-20 10:10:03,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:03,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:10:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:03,115 INFO L225 Difference]: With dead ends: 83 [2019-01-20 10:10:03,116 INFO L226 Difference]: Without dead ends: 82 [2019-01-20 10:10:03,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-20 10:10:03,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-20 10:10:03,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-20 10:10:03,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-01-20 10:10:03,159 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-01-20 10:10:03,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:03,159 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-01-20 10:10:03,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-01-20 10:10:03,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:03,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:03,160 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:10:03,161 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:03,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:03,161 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-01-20 10:10:03,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:03,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:03,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:03,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:03,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:03,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:03,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:03,259 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:03,259 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-20 10:10:03,259 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:03,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:03,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:03,265 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:03,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:03,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:03,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:03,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:03,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:03,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:03,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:03,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:10:03,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:10:03,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:10:03,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:03,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:03,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:03,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:03,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:10:03,418 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,432 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,444 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,454 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,464 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:03,483 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-20 10:10:03,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:10:03,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:03,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:10:03,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:03,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2019-01-20 10:10:03,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:03,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:03,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-01-20 10:10:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:03,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:03,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:03,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:10:03,609 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:03,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:03,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:03,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:03,609 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-01-20 10:10:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:04,020 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-01-20 10:10:04,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:04,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:10:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:04,021 INFO L225 Difference]: With dead ends: 86 [2019-01-20 10:10:04,021 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:10:04,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:10:04,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-01-20 10:10:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-20 10:10:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-01-20 10:10:04,079 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-01-20 10:10:04,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:04,079 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-01-20 10:10:04,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:04,079 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-01-20 10:10:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:04,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:04,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:04,080 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:04,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:04,080 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-20 10:10:04,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:04,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:04,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:04,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:04,235 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:10:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:04,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:04,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:04,522 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:04,522 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-20 10:10:04,523 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:04,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:04,527 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:04,527 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:04,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:04,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:04,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:04,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:04,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:04,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:04,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:04,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:04,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:04,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:04,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:04,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:10:04,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:10:04,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:10:04,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:10:04,761 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,786 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,799 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,809 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,819 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:04,848 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:10:04,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:10:04,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:04,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:04,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:10:04,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:04,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-20 10:10:05,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:05,012 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:05,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-20 10:10:05,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:05,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:05,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-20 10:10:05,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:05,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:05,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:05,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:05,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:05,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:05,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:05,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:05,239 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-01-20 10:10:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:05,902 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-01-20 10:10:05,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:05,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:10:05,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:05,903 INFO L225 Difference]: With dead ends: 100 [2019-01-20 10:10:05,903 INFO L226 Difference]: Without dead ends: 99 [2019-01-20 10:10:05,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:10:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-20 10:10:05,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-01-20 10:10:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-20 10:10:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-01-20 10:10:05,974 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-01-20 10:10:05,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:05,974 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-01-20 10:10:05,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-01-20 10:10:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:05,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:05,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:05,975 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:05,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:05,975 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-20 10:10:05,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:05,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:05,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:05,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:05,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:06,130 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:10:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:06,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:06,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:06,223 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:06,224 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-20 10:10:06,224 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:06,224 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:06,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:06,228 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:06,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:06,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:06,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:06,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:06,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:06,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:06,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:06,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 43 treesize of output 39 [2019-01-20 10:10:06,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:10:06,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:10:06,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:10:06,425 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,470 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:06,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:06,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:06,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:06,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:10:06,559 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,594 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,616 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,628 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,641 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:06,679 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:10:06,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:10:06,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:06,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:10:06,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:10:06,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:06,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:10:06,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:06,856 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:06,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:10:06,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:06,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:06,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:10:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:06,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:06,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:06,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:06,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:06,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:06,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:06,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:06,949 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-01-20 10:10:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:07,421 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-01-20 10:10:07,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:07,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:10:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:07,424 INFO L225 Difference]: With dead ends: 104 [2019-01-20 10:10:07,424 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 10:10:07,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:10:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 10:10:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-01-20 10:10:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-20 10:10:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-20 10:10:07,537 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-20 10:10:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:07,537 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-20 10:10:07,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-20 10:10:07,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:07,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:07,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:07,539 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:07,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:07,539 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-20 10:10:07,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:07,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:07,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:07,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:07,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:07,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:07,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:07,608 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:07,608 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-20 10:10:07,612 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:07,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:07,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:07,615 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:07,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:07,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:07,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:07,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:07,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:07,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:07,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:07,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:10:07,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:10:07,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:10:07,704 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:07,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:10:07,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:10:07,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:10:07,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:10:07,750 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,766 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,799 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,809 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,818 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:07,837 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:10:07,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:10:07,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:07,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:10:07,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:10:07,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:07,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:10:07,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,972 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:07,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:10:07,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,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-01-20 10:10:07,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:10:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:08,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:08,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:08,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:08,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:08,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:08,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:08,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:08,067 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-01-20 10:10:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:08,620 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-01-20 10:10:08,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:08,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:10:08,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:08,622 INFO L225 Difference]: With dead ends: 107 [2019-01-20 10:10:08,622 INFO L226 Difference]: Without dead ends: 106 [2019-01-20 10:10:08,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:10:08,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-20 10:10:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-01-20 10:10:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-20 10:10:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-20 10:10:08,721 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-20 10:10:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:08,721 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-20 10:10:08,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-20 10:10:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:08,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:08,722 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:08,722 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:08,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:08,722 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-01-20 10:10:08,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:08,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:08,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:08,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:08,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:08,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:08,771 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:08,771 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-20 10:10:08,771 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:08,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:08,773 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:08,773 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:08,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:08,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:08,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:08,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:08,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:08,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:08,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:08,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:08,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:08,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:08,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:08,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:10:08,856 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,884 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,908 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:10:08,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:10:08,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10: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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:10:09,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:10:09,032 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,047 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,060 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,076 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:09,103 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:10:09,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:10:09,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:09,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:10:09,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:09,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:09,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-20 10:10:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:09,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:09,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:09,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:09,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:09,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:09,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:09,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:09,272 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-01-20 10:10:09,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:09,649 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-01-20 10:10:09,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:09,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:10:09,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:09,651 INFO L225 Difference]: With dead ends: 100 [2019-01-20 10:10:09,651 INFO L226 Difference]: Without dead ends: 98 [2019-01-20 10:10:09,652 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-01-20 10:10:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-20 10:10:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-01-20 10:10:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 10:10:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-01-20 10:10:09,763 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-01-20 10:10:09,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:09,763 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-01-20 10:10:09,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:09,764 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-01-20 10:10:09,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:09,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:09,764 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:09,764 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:09,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:09,765 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-20 10:10:09,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:09,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:09,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:09,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:09,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:09,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:09,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:09,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:09,863 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:09,863 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-20 10:10:09,865 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:09,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:09,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:09,867 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:09,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:09,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:09,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:09,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:09,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:09,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:09,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:09,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:10:09,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:10:09,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:10:09,967 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,979 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:10,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:10:10,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:10:10,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:10:10,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:10:10,020 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,038 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,051 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,071 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:10,091 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:10:10,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:10:10,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:10:10,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-20 10:10:10,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:199 [2019-01-20 10:10:10,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 57 [2019-01-20 10:10:10,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,471 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:10,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 43 treesize of output 65 [2019-01-20 10:10:10,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,544 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:10,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-01-20 10:10:10,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:10:10,597 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:142, output treesize:92 [2019-01-20 10:10:10,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-20 10:10:10,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 61 [2019-01-20 10:10:10,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,781 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:10,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-20 10:10:10,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-20 10:10:10,827 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-01-20 10:10:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:10,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:10,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:10,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:10,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:10,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:10,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:10,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:10,959 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-01-20 10:10:11,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:11,959 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-20 10:10:11,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:11,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:10:11,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:11,961 INFO L225 Difference]: With dead ends: 124 [2019-01-20 10:10:11,961 INFO L226 Difference]: Without dead ends: 123 [2019-01-20 10:10:11,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:10:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-20 10:10:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-01-20 10:10:12,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-20 10:10:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-01-20 10:10:12,078 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-01-20 10:10:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:12,078 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-01-20 10:10:12,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-01-20 10:10:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:12,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:12,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:12,079 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:12,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:12,079 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-20 10:10:12,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:12,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:12,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:12,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:12,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:12,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:12,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:12,218 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:12,218 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-20 10:10:12,219 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:12,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:12,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:12,221 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:12,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:12,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:12,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:12,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:12,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:12,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:12,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:12,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:12,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:10:12,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:10:12,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:10:12,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:10:12,280 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,306 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:12,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:12,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:12,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:12,488 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,504 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,520 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,537 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:12,568 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:10:12,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:10:12,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,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-01-20 10:10:12,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:12,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,666 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:12,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:10:12,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,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-01-20 10:10:12,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-20 10:10:12,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,888 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:12,889 INFO L303 Elim1Store]: Index analysis took 168 ms [2019-01-20 10:10:12,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:10:12,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:12,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:10:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:12,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:12,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:12,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:10:12,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:12,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:10:12,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:10:12,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:12,998 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-01-20 10:10:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:13,569 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-01-20 10:10:13,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:13,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:10:13,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:13,571 INFO L225 Difference]: With dead ends: 114 [2019-01-20 10:10:13,571 INFO L226 Difference]: Without dead ends: 113 [2019-01-20 10:10:13,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 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-01-20 10:10:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-20 10:10:13,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-01-20 10:10:13,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 10:10:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-01-20 10:10:13,715 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-01-20 10:10:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:13,715 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-01-20 10:10:13,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:10:13,715 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-01-20 10:10:13,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:13,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:13,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:13,716 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:13,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:13,716 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-01-20 10:10:13,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:13,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:13,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:13,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:13,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:13,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:13,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:13,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:13,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:13,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:13,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:13,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:10:13,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:10:13,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:10:13,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:10:13,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:13,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:13,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:10:13,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:10:13,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:10:13,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:10:13,895 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,923 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:14,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:14,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10: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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:14,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:14,113 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,130 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,146 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,163 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:14,195 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-20 10:10:14,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:10:14,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,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-01-20 10:10:14,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:14,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:10:14,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:14,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-20 10:10:14,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,337 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:14,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:10:14,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:14,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-20 10:10:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:14,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:14,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:14,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:10:14,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:14,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:14,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:14,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:14,435 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-01-20 10:10:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:15,043 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-01-20 10:10:15,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:10:15,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:10:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:15,046 INFO L225 Difference]: With dead ends: 164 [2019-01-20 10:10:15,046 INFO L226 Difference]: Without dead ends: 163 [2019-01-20 10:10:15,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-20 10:10:15,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-01-20 10:10:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-20 10:10:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-01-20 10:10:15,438 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-01-20 10:10:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:15,438 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-01-20 10:10:15,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-01-20 10:10:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:15,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:15,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:15,439 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-01-20 10:10:15,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:15,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:10:15,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:15,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:15,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:15,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:15,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:15,537 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-20 10:10:15,538 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:15,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:15,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:15,540 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:15,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:15,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:15,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:15,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:15,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:15,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:15,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:15,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:10:15,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:10:15,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:10:15,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:10:15,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,697 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:15,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:15,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:15,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:15,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:10:15,749 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,772 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,785 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,795 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,805 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:15,834 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:10:15,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:10:15,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:15,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:15,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:10:15,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:10:15,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:16,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:10:16,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-20 10:10:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:16,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:16,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:16,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:16,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:16,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:16,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:16,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:16,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:16,102 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-01-20 10:10:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:16,602 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-01-20 10:10:16,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:16,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:10:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:16,605 INFO L225 Difference]: With dead ends: 160 [2019-01-20 10:10:16,605 INFO L226 Difference]: Without dead ends: 159 [2019-01-20 10:10:16,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-20 10:10:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-01-20 10:10:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-20 10:10:16,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-01-20 10:10:16,848 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-01-20 10:10:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:16,848 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-01-20 10:10:16,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-01-20 10:10:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:16,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:16,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:16,849 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:16,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:16,849 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-01-20 10:10:16,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:16,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:16,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:16,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:16,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:16,997 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-20 10:10:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:17,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:17,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:17,032 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:17,033 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-20 10:10:17,033 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:17,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:17,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:17,036 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:17,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:17,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:17,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:17,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:17,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:17,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:17,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:17,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:17,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:17,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:17,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:17,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:10:17,104 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,155 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:10:17,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:10:17,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:10:17,227 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,236 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,245 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:17,265 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-20 10:10:17,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:10:17,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:17,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:10:17,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-20 10:10:17,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:17,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-20 10:10:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:17,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:17,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:17,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:10:17,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:17,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:17,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:17,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:17,395 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-01-20 10:10:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:18,211 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-01-20 10:10:18,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:18,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:10:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:18,214 INFO L225 Difference]: With dead ends: 175 [2019-01-20 10:10:18,214 INFO L226 Difference]: Without dead ends: 174 [2019-01-20 10:10:18,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:10:18,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-20 10:10:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-01-20 10:10:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-20 10:10:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-20 10:10:18,447 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-20 10:10:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:18,447 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-20 10:10:18,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-20 10:10:18,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:18,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:18,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:18,448 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:18,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:18,448 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-20 10:10:18,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:18,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:18,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:18,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:18,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:10:18,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:10:18,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:10:18,558 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:18,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:10:18,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:10:18,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:10:18,558 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-01-20 10:10:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:18,932 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-01-20 10:10:18,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:10:18,932 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-20 10:10:18,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:18,934 INFO L225 Difference]: With dead ends: 185 [2019-01-20 10:10:18,934 INFO L226 Difference]: Without dead ends: 184 [2019-01-20 10:10:18,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:10:18,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-20 10:10:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-01-20 10:10:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-20 10:10:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-20 10:10:19,162 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-20 10:10:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:19,162 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-20 10:10:19,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:10:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-20 10:10:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:19,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:19,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:19,163 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:19,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-01-20 10:10:19,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:19,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:19,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:19,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:19,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:19,250 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:19,251 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-20 10:10:19,252 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:19,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:19,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:19,254 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:19,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:19,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:19,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:19,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:19,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:19,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:19,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 26 treesize of output 25 [2019-01-20 10:10:19,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:10:19,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:10:19,323 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,331 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:19,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:19,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:19,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:19,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:10:19,372 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,389 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,401 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,412 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:19,442 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-20 10:10:19,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-20 10:10:19,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:19,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-20 10:10:19,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,503 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:19,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-20 10:10:19,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:19,517 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:10:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:19,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:19,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:19,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:19,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:19,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:19,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:19,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:19,570 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-01-20 10:10:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:20,053 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-01-20 10:10:20,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:20,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:10:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:20,055 INFO L225 Difference]: With dead ends: 142 [2019-01-20 10:10:20,056 INFO L226 Difference]: Without dead ends: 141 [2019-01-20 10:10:20,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:20,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-20 10:10:20,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-01-20 10:10:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-20 10:10:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-01-20 10:10:20,303 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-01-20 10:10:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:20,303 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-01-20 10:10:20,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-01-20 10:10:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:20,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:20,304 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:10:20,304 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:20,304 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-01-20 10:10:20,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:20,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:20,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:20,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:20,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:20,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:20,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:20,409 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:20,409 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-20 10:10:20,410 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:20,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:20,411 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:20,412 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:20,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:20,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:20,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:20,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:20,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:20,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:20,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:20,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:20,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:20,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:20,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:20,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:10:20,457 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,493 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:10:20,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:10:20,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:10:20,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:10:20,646 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,661 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,675 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,691 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:20,720 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:10:20,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:10:20,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:20,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:10:20,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-20 10:10:20,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,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 33 treesize of output 59 [2019-01-20 10:10:20,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:20,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-20 10:10:20,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-20 10:10:20,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:20,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:10:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:20,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:21,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:21,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-20 10:10:21,011 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:21,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:10:21,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:10:21,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:10:21,012 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-01-20 10:10:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:21,765 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-01-20 10:10:21,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:10:21,766 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:10:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:21,768 INFO L225 Difference]: With dead ends: 219 [2019-01-20 10:10:21,769 INFO L226 Difference]: Without dead ends: 216 [2019-01-20 10:10:21,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-20 10:10:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-01-20 10:10:22,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-20 10:10:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-01-20 10:10:22,063 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-01-20 10:10:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:22,064 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-01-20 10:10:22,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:10:22,064 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-01-20 10:10:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:22,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:22,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:22,064 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:22,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-01-20 10:10:22,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:22,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:22,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:22,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:22,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:22,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:22,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:22,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:22,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:22,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:22,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:22,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:10:22,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:10:22,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:10:22,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:10:22,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:22,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:10:22,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:10:22,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:10:22,261 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:22,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:10:22,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:10:22,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:10:22,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:10:22,310 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,327 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,341 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,351 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,361 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:22,382 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-20 10:10:22,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,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, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-20 10:10:22,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:22,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-20 10:10:22,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-01-20 10:10:22,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 80 [2019-01-20 10:10:22,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:22,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-01-20 10:10:22,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-20 10:10:22,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-01-20 10:10:22,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,806 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:22,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 88 [2019-01-20 10:10:22,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-01-20 10:10:22,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,002 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:23,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-01-20 10:10:23,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:23,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-20 10:10:23,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:23,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-20 10:10:23,200 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-01-20 10:10:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:23,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:23,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:23,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:10:23,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:23,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:23,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:23,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:23,373 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-01-20 10:10:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:24,543 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-01-20 10:10:24,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:10:24,544 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:10:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:24,546 INFO L225 Difference]: With dead ends: 218 [2019-01-20 10:10:24,546 INFO L226 Difference]: Without dead ends: 215 [2019-01-20 10:10:24,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:10:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-20 10:10:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-01-20 10:10:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-20 10:10:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-01-20 10:10:24,890 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-01-20 10:10:24,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:24,891 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-01-20 10:10:24,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:24,891 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-01-20 10:10:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:24,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:24,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:24,892 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:24,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:24,892 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-01-20 10:10:24,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:24,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:10:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:24,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:25,056 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-20 10:10:25,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:25,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:25,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:25,067 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:25,067 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-20 10:10:25,068 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:25,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:25,070 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:25,070 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:25,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:25,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:25,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:25,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:25,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:25,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:25,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:25,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:10:25,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:10:25,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:10:25,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:10:25,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,224 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:25,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:25,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:25,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:25,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:10:25,274 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,613 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,670 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,680 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,690 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:25,719 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:10:25,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:10:25,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:25,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:10:25,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:25,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-20 10:10:25,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:25,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:25,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-20 10:10:25,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:25,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:25,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:25,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:10:25,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:25,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:25,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:25,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:25,872 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-01-20 10:10:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:26,697 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-01-20 10:10:26,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:26,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:10:26,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:26,700 INFO L225 Difference]: With dead ends: 274 [2019-01-20 10:10:26,701 INFO L226 Difference]: Without dead ends: 269 [2019-01-20 10:10:26,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-20 10:10:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-01-20 10:10:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-20 10:10:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-01-20 10:10:27,198 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-01-20 10:10:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:27,198 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-01-20 10:10:27,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-01-20 10:10:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:10:27,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:27,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:10:27,199 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:27,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:27,199 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-01-20 10:10:27,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:27,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:27,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:27,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:27,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:27,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:27,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:27,369 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:10:27,369 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-20 10:10:27,369 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:27,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:27,371 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:27,372 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:27,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:27,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:27,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:27,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:27,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:27,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:27,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:27,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:27,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:27,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:27,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:27,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:10:27,424 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:27,479 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:27,493 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:27,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:27,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:27,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:10:27,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:10:27,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:10:27,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:10:27,634 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:27,647 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:27,661 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:27,678 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:27,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:27,706 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:10:27,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:10:27,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:27,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:27,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:10:27,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:10:27,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:27,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:10:27,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-20 10:10:27,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:27,957 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:27,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-01-20 10:10:27,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:27,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:27,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-20 10:10:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:27,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:28,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:28,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-20 10:10:28,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:28,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:28,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:28,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:10:28,033 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-01-20 10:10:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:29,587 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-01-20 10:10:29,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:10:29,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:10:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:29,593 INFO L225 Difference]: With dead ends: 480 [2019-01-20 10:10:29,593 INFO L226 Difference]: Without dead ends: 477 [2019-01-20 10:10:29,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:10:29,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-20 10:10:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-01-20 10:10:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-20 10:10:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-01-20 10:10:30,460 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-01-20 10:10:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:30,461 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-01-20 10:10:30,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:30,461 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-01-20 10:10:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:10:30,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:30,462 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:10:30,462 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:30,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:30,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-01-20 10:10:30,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:30,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:30,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:30,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:30,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:30,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:30,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:30,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:10:30,500 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-01-20 10:10:30,500 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:30,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:30,502 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:30,503 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:30,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:30,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:30,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:30,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:30,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:30,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:30,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:30,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:30,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:30,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-20 10:10:30,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-20 10:10:30,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-20 10:10:30,558 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,568 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,577 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,587 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:30,605 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-20 10:10:30,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-20 10:10:30,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-20 10:10:30,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:30,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-01-20 10:10:30,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:30,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-20 10:10:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:30,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:30,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:10:30,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-01-20 10:10:30,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:30,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:10:30,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:10:30,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:30,652 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-01-20 10:10:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:32,572 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-01-20 10:10:32,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:10:32,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-20 10:10:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:32,578 INFO L225 Difference]: With dead ends: 804 [2019-01-20 10:10:32,579 INFO L226 Difference]: Without dead ends: 800 [2019-01-20 10:10:32,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-01-20 10:10:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-01-20 10:10:34,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-01-20 10:10:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-01-20 10:10:34,573 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-01-20 10:10:34,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:34,573 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-01-20 10:10:34,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:10:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-01-20 10:10:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:10:34,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:34,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:10:34,576 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:34,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:34,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-20 10:10:34,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:34,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:34,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:34,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:34,764 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-20 10:10:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:34,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:34,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:34,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:10:34,924 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-20 10:10:34,926 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:34,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:34,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:34,929 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:10:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:34,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:34,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:34,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:34,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:34,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:34,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:34,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:34,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:10:34,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:10:34,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:10:34,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:10:35,022 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,054 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,081 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:35,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:35,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:35,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:35,238 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,255 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,271 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,287 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,317 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-20 10:10:35,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:10:35,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:35,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:35,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:10:35,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:35,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:10:35,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,492 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:35,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-20 10:10:35,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:35,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-20 10:10:35,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,598 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:35,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:10:35,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:35,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-20 10:10:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:35,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:35,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:35,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:35,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:10:35,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:35,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:10:35,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:10:35,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:10:35,743 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-01-20 10:10:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:38,392 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-01-20 10:10:38,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:38,393 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:10:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:38,399 INFO L225 Difference]: With dead ends: 821 [2019-01-20 10:10:38,400 INFO L226 Difference]: Without dead ends: 820 [2019-01-20 10:10:38,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:10:38,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-01-20 10:10:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-01-20 10:10:40,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-01-20 10:10:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-01-20 10:10:40,315 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-01-20 10:10:40,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:40,315 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-01-20 10:10:40,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:10:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-01-20 10:10:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:10:40,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:40,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:10:40,318 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:40,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:40,318 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-20 10:10:40,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:40,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:40,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:40,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:40,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:40,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:40,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:40,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:10:40,363 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-20 10:10:40,364 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:40,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:40,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:40,366 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:40,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:40,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:40,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:40,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:40,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:40,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:40,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-20 10:10:40,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-20 10:10:40,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-01-20 10:10:40,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-20 10:10:40,441 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:40,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:40,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-20 10:10:40,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-20 10:10:40,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:10:40,507 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,521 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,531 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,539 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,549 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:40,567 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-01-20 10:10:40,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-20 10:10:40,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-20 10:10:40,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:10:40,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:40,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-20 10:10:40,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-01-20 10:10:40,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:40,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:40,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:40,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:40,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:40,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:40,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:40,670 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-01-20 10:10:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:42,727 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-01-20 10:10:42,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:42,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:10:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:42,733 INFO L225 Difference]: With dead ends: 805 [2019-01-20 10:10:42,733 INFO L226 Difference]: Without dead ends: 804 [2019-01-20 10:10:42,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:10:42,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-01-20 10:10:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-01-20 10:10:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-20 10:10:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-01-20 10:10:44,736 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-01-20 10:10:44,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:44,736 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-01-20 10:10:44,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-01-20 10:10:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:10:44,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:44,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:10:44,739 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:44,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-01-20 10:10:44,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:44,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:44,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:45,156 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-01-20 10:10:45,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:45,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:45,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:45,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:10:45,203 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-20 10:10:45,203 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:45,204 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:45,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:45,206 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:10:45,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:45,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:45,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:45,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:45,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:45,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:45,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:45,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:45,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:45,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:45,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:45,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:10:45,254 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,306 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:10:45,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:10:45,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:10:45,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:10:45,446 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,461 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,476 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,493 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:45,523 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:10:45,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:10:45,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:45,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:10:45,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:10:45,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:45,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:10:45,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,665 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:45,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:45,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-01-20 10:10:45,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:45,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:10:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:45,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:45,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:45,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:10:45,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:45,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:10:45,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:10:45,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:45,784 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-01-20 10:10:48,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:48,588 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-01-20 10:10:48,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:10:48,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:10:48,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:48,598 INFO L225 Difference]: With dead ends: 1004 [2019-01-20 10:10:48,598 INFO L226 Difference]: Without dead ends: 1003 [2019-01-20 10:10:48,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:10:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-01-20 10:10:50,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-01-20 10:10:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-01-20 10:10:50,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-01-20 10:10:50,742 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-01-20 10:10:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:50,742 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-01-20 10:10:50,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:10:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-01-20 10:10:50,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:10:50,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:50,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:10:50,744 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:50,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:50,744 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-01-20 10:10:50,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:50,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:50,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:50,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:50,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:50,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-01-20 10:10:50,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:50,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:50,836 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:10:50,836 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-20 10:10:50,837 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:50,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:50,843 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:50,844 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:50,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:50,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:50,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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:50,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:50,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:50,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:50,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:10:50,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:10:50,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:50,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:10:50,910 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:50,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:50,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:50,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:50,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:10:50,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:10:50,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:10:50,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:10:50,958 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:50,981 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:50,992 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:51,000 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:51,009 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:51,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:51,027 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-20 10:10:51,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:51,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-20 10:10:51,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:51,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:51,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-01-20 10:10:51,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:51,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:51,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:51,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:51,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:51,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:51,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:10:51,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:51,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:10:51,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-01-20 10:10:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:51,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:51,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:51,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-20 10:10:51,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:51,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:10:51,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:10:51,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:51,218 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-01-20 10:10:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:54,381 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-01-20 10:10:54,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:10:54,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-20 10:10:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:54,390 INFO L225 Difference]: With dead ends: 1213 [2019-01-20 10:10:54,390 INFO L226 Difference]: Without dead ends: 1212 [2019-01-20 10:10:54,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:54,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-01-20 10:10:57,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-01-20 10:10:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-01-20 10:10:57,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-01-20 10:10:57,192 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-01-20 10:10:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:57,192 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-01-20 10:10:57,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:10:57,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-01-20 10:10:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:10:57,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:57,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:10:57,195 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:57,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:57,195 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-01-20 10:10:57,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:57,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:57,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:57,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:57,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:57,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:57,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:57,352 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:10:57,353 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-20 10:10:57,354 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:57,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:57,356 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:57,356 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:10:57,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:57,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:57,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:57,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:57,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:57,373 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:57,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:57,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:10:57,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:10:57,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:10:57,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:10:57,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:10:57,424 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,450 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,475 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:10:57,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:10:57,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:10:57,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:10:57,627 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,643 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,657 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,672 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:57,701 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:10:57,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:10:57,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:57,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:10:57,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,823 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:57,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-20 10:10:57,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:57,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-01-20 10:10:57,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,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 40 treesize of output 82 [2019-01-20 10:10:57,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:57,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-01-20 10:10:57,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:57,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:57,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-20 10:10:57,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:57,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:57,988 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:10:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:58,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:58,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:58,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:10:58,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:58,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:10:58,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:10:58,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:10:58,073 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-01-20 10:11:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:02,336 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-01-20 10:11:02,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:11:02,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:11:02,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:02,350 INFO L225 Difference]: With dead ends: 1577 [2019-01-20 10:11:02,351 INFO L226 Difference]: Without dead ends: 1575 [2019-01-20 10:11:02,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:11:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-01-20 10:11:04,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-01-20 10:11:04,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-20 10:11:04,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-01-20 10:11:04,340 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-01-20 10:11:04,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:04,341 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-01-20 10:11:04,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:11:04,341 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-01-20 10:11:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:11:04,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:04,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:11:04,342 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:04,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:04,342 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-01-20 10:11:04,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:04,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:04,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:04,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:04,493 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:11:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:04,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:04,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:04,629 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:11:04,629 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-20 10:11:04,629 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:04,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:04,631 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:04,631 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:11:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:04,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:04,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:04,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:04,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:04,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:04,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:04,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:11:04,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:11:04,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:11:04,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:11:04,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:11:04,682 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,723 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:11:04,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:11:04,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:11:04,812 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,822 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,830 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:04,850 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:11:04,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:11:04,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:04,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:11:04,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,931 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:04,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-20 10:11:04,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:04,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:04,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-20 10:11:04,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:04,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-20 10:11:04,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:05,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-20 10:11:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:05,040 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:05,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-20 10:11:05,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:05,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:05,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-20 10:11:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:05,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:05,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:05,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:11:05,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:05,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:11:05,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:11:05,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:11:05,149 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-01-20 10:11:08,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:08,413 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-01-20 10:11:08,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:11:08,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:11:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:08,420 INFO L225 Difference]: With dead ends: 1108 [2019-01-20 10:11:08,420 INFO L226 Difference]: Without dead ends: 1107 [2019-01-20 10:11:08,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:11:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-01-20 10:11:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-01-20 10:11:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-20 10:11:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-01-20 10:11:11,228 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-01-20 10:11:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:11,228 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-01-20 10:11:11,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:11:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-01-20 10:11:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:11:11,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:11,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:11:11,231 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:11,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-01-20 10:11:11,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:11,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:11,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:11,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:11,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:11,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:11,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:11,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:11:11,318 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-20 10:11:11,319 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:11,319 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:11,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:11,321 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:11,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:11,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:11,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:11,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:11,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:11,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:11,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:11,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-01-20 10:11:11,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:11:11,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:11:11,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:11:11,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:11:11,374 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:11,399 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:11,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:11,420 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:11,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:11,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:11:11,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:11:11,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:11:11,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:11:11,543 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:11,558 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:11,571 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:11,586 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:11,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:11,612 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:11:11,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:11:11,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:11,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:11,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:11:11,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:11,689 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:11,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:11:11,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:11:11,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:11:11,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-20 10:11:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:11,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:11,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:11,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:11,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:11:11,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:11,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:11,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:11,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:11,857 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-01-20 10:11:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:14,788 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-01-20 10:11:14,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:11:14,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:11:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:14,793 INFO L225 Difference]: With dead ends: 1075 [2019-01-20 10:11:14,793 INFO L226 Difference]: Without dead ends: 1074 [2019-01-20 10:11:14,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:11:14,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-01-20 10:11:17,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-01-20 10:11:17,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-01-20 10:11:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-01-20 10:11:17,576 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-01-20 10:11:17,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:17,576 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-01-20 10:11:17,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:17,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-01-20 10:11:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:11:17,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:17,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:11:17,578 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:17,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:17,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-01-20 10:11:17,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:17,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:17,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:17,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:17,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:17,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:17,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:17,679 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:11:17,679 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-20 10:11:17,679 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:17,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:17,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:17,681 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:11:17,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:17,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:17,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:17,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:17,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:17,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:17,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:17,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:11:17,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:11:17,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:11:17,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:11:17,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:11:17,738 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:17,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:17,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:17,786 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:17,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:17,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:11:17,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:11:17,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:11:17,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:17,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:11:17,935 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:17,950 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:17,965 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:17,980 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:18,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:18,009 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:11:18,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:11:18,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:18,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:18,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:11:18,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,251 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:18,251 INFO L303 Elim1Store]: Index analysis took 157 ms [2019-01-20 10:11:18,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:11:18,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:18,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:18,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-20 10:11:18,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:11:18,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:18,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:18,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-20 10:11:18,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,610 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:18,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:11:18,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:18,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:18,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-20 10:11:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:18,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:18,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:18,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:11:18,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:18,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:11:18,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:11:18,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:11:18,764 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-01-20 10:11:23,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:23,247 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-01-20 10:11:23,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:11:23,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:11:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:23,253 INFO L225 Difference]: With dead ends: 1522 [2019-01-20 10:11:23,254 INFO L226 Difference]: Without dead ends: 1521 [2019-01-20 10:11:23,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:11:23,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-01-20 10:11:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-01-20 10:11:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-01-20 10:11:26,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-01-20 10:11:26,345 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-01-20 10:11:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:26,345 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-01-20 10:11:26,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:11:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-01-20 10:11:26,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:11:26,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:26,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:11:26,347 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:26,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-20 10:11:26,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:26,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:26,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:26,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:26,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:26,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:26,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:26,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:26,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:11:26,390 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-20 10:11:26,390 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:26,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:26,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:26,392 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:11:26,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:26,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:26,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:26,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:26,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:26,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:26,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:26,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:11:26,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:11:26,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-20 10:11:26,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-20 10:11:26,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-20 10:11:26,503 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,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-01-20 10:11:26,548 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-20 10:11:26,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-20 10:11:26,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-20 10:11:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:26,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:26,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:11:26,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:11:26,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:11:26,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:11:26,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:11:26,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:11:26,592 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-01-20 10:11:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:30,545 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-01-20 10:11:30,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:11:30,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-20 10:11:30,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:30,553 INFO L225 Difference]: With dead ends: 1559 [2019-01-20 10:11:30,553 INFO L226 Difference]: Without dead ends: 1554 [2019-01-20 10:11:30,554 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-01-20 10:11:30,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-01-20 10:11:34,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-01-20 10:11:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-01-20 10:11:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-01-20 10:11:34,853 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-01-20 10:11:34,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:34,853 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-01-20 10:11:34,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:11:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-01-20 10:11:34,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:11:34,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:34,855 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:11:34,855 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:34,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-20 10:11:34,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:34,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:34,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:34,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:34,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:34,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:34,921 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:11:34,921 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-20 10:11:34,922 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:34,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:34,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:34,925 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:34,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:34,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:34,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:34,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:34,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:34,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:34,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:34,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:11:34,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:11:34,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:11:34,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:11:34,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:11:34,972 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,999 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,021 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:11:35,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:11:35,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:11:35,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:11:35,186 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,200 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,213 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,228 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:35,255 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:11:35,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:11:35,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:35,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:11:35,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:11:35,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:11:35,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:11:35,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-20 10:11:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:35,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:35,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:35,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:11:35,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:35,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:35,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:35,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:11:35,510 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-01-20 10:11:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:39,794 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-01-20 10:11:39,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:39,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:11:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:39,798 INFO L225 Difference]: With dead ends: 1574 [2019-01-20 10:11:39,799 INFO L226 Difference]: Without dead ends: 1570 [2019-01-20 10:11:39,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:11:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-01-20 10:11:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-01-20 10:11:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-01-20 10:11:44,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-01-20 10:11:44,036 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-01-20 10:11:44,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:44,036 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-01-20 10:11:44,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:44,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-01-20 10:11:44,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:11:44,038 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:44,038 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-20 10:11:44,038 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:44,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:44,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-01-20 10:11:44,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:44,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:44,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:44,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:44,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:44,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:11:44,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:44,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:44,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:11:44,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:11:44,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:44,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:44,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:11:44,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:11:44,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:11:44,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:11:44,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:44,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:11:44,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:11:44,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:11:44,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:11:44,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:11:44,211 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,236 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,256 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:11:44,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:11:44,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:11:44,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:11:44,386 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,401 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,414 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,429 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:44,455 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:11:44,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:11:44,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:44,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-20 10:11:44,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:11:44,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:11:44,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:11:44,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-20 10:11:44,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,691 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:44,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:11:44,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:44,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-01-20 10:11:44,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:44,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-20 10:11:44,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:44,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:44,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-20 10:11:44,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-01-20 10:11:44,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:44,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:44,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:11:44,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:44,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:11:44,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:11:44,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:11:44,855 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-01-20 10:11:50,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:50,740 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-01-20 10:11:50,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:11:50,740 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:11:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:50,745 INFO L225 Difference]: With dead ends: 2098 [2019-01-20 10:11:50,745 INFO L226 Difference]: Without dead ends: 2091 [2019-01-20 10:11:50,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:11:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-20 10:11:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-01-20 10:11:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-20 10:11:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-01-20 10:11:55,851 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-01-20 10:11:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:55,851 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-01-20 10:11:55,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:11:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-01-20 10:11:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:11:55,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:55,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:11:55,854 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:55,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:55,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-01-20 10:11:55,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:55,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:55,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:11:55,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:55,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:55,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:55,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:55,901 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:11:55,901 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-20 10:11:55,901 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:55,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:55,903 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:55,903 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:55,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:55,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:55,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:55,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:11:55,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:55,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:55,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:55,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:11:55,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:11:55,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:11:55,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:11:55,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:55,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:11:55,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:55,989 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:11:56,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:11:56,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:11:56,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:11:56,136 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,150 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,163 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,180 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:56,210 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:11:56,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:11:56,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:56,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-20 10:11:56,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:56,336 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:56,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:11:56,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:56,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:56,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-20 10:11:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:56,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:56,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:56,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:11:56,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:56,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:56,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:56,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:56,460 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-01-20 10:12:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:01,448 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-01-20 10:12:01,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:12:01,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:12:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:01,453 INFO L225 Difference]: With dead ends: 1846 [2019-01-20 10:12:01,453 INFO L226 Difference]: Without dead ends: 1839 [2019-01-20 10:12:01,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:12:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-01-20 10:12:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-01-20 10:12:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-20 10:12:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-01-20 10:12:06,575 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-01-20 10:12:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:06,575 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-01-20 10:12:06,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:12:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-01-20 10:12:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:12:06,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:06,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:12:06,578 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:06,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:06,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-01-20 10:12:06,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:06,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:06,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:06,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:06,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:06,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:12:06,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:06,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:06,704 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:12:06,704 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-20 10:12:06,705 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:06,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:06,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:06,707 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:12:06,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:06,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:06,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:06,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:06,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:06,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:06,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:06,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:12:06,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:12:06,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:12:06,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:12:06,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:12:06,756 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:06,781 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:06,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:06,805 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:06,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:06,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:12:06,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:12:06,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:12:06,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:06,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:12:06,929 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:06,944 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:06,957 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:06,972 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:06,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:06,999 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:12:07,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:12:07,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:07,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:07,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-01-20 10:12:07,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2019-01-20 10:12:07,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:07,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 78 [2019-01-20 10:12:07,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:07,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:07,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-01-20 10:12:07,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,386 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:07,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-20 10:12:07,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:07,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,446 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:07,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:07,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-20 10:12:07,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:07,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:07,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-20 10:12:08,998 WARN L181 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 51 [2019-01-20 10:12:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:09,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:09,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:09,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:09,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-20 10:12:09,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:09,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:12:09,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:12:09,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:12:09,058 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-01-20 10:12:10,873 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-20 10:12:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:15,860 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-01-20 10:12:15,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:12:15,861 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:12:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:15,866 INFO L225 Difference]: With dead ends: 2193 [2019-01-20 10:12:15,866 INFO L226 Difference]: Without dead ends: 2192 [2019-01-20 10:12:15,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:12:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-01-20 10:12:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-01-20 10:12:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-01-20 10:12:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-01-20 10:12:21,325 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-01-20 10:12:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:21,325 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-01-20 10:12:21,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:12:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-01-20 10:12:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:12:21,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:21,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:12:21,328 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:21,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:21,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-01-20 10:12:21,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:21,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:21,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:21,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:21,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:21,481 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:12:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:21,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:21,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:21,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:12:21,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:12:21,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:21,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:21,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:12:21,685 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:12:21,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:12:21,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:12:21,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:21,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:12:21,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:12:21,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:12:21,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:21,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:12:21,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:21,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:12:21,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:12:21,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:12:21,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:12:21,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:12:21,977 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:22,046 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:22,059 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:22,070 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:22,079 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:22,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:22,108 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:12:22,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,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 72 [2019-01-20 10:12:22,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:22,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-01-20 10:12:22,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:12:22,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:12:22,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:22,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:22,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-20 10:12:22,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,289 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:22,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:12:22,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:22,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:22,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-20 10:12:22,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:22,355 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:22,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-20 10:12:22,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:22,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-01-20 10:12:22,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-20 10:12:22,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:22,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:22,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:22,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:12:22,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:22,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:12:22,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:12:22,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:12:22,478 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-01-20 10:12:29,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:29,647 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-01-20 10:12:29,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:12:29,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:12:29,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:29,653 INFO L225 Difference]: With dead ends: 2526 [2019-01-20 10:12:29,653 INFO L226 Difference]: Without dead ends: 2520 [2019-01-20 10:12:29,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:12:29,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-01-20 10:12:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-01-20 10:12:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-01-20 10:12:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-01-20 10:12:35,307 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-01-20 10:12:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:35,307 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-01-20 10:12:35,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:12:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-01-20 10:12:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:12:35,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:35,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:12:35,311 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-01-20 10:12:35,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:35,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:12:35,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:35,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:35,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:12:35,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:35,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:35,437 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:12:35,437 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-01-20 10:12:35,438 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:12:35,439 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:12:35,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:12:35,440 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:12:35,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:35,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:12:35,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:35,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:35,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:35,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:12:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:35,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:35,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-01-20 10:12:35,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:12:35,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:12:35,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:12:35,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:12:35,488 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:35,513 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:35,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:35,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:35,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:35,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:12:35,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:12:35,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:12:35,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:12:35,668 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:35,683 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:35,695 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:35,710 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:35,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:35,737 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:12:35,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:12:35,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:35,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:35,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-01-20 10:12:35,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:35,979 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:35,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:12:35,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:35,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:36,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-01-20 10:12:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:36,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:36,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:36,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-20 10:12:36,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:36,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:12:36,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:12:36,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:12:36,059 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-01-20 10:12:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:41,552 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-01-20 10:12:41,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:12:41,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-20 10:12:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:41,557 INFO L225 Difference]: With dead ends: 1971 [2019-01-20 10:12:41,557 INFO L226 Difference]: Without dead ends: 1964 [2019-01-20 10:12:41,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:12:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-20 10:12:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-20 10:12:47,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-20 10:12:47,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-01-20 10:12:47,131 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-01-20 10:12:47,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:47,131 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-01-20 10:12:47,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:12:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-01-20 10:12:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:12:47,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:47,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:12:47,136 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:47,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:47,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-01-20 10:12:47,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:47,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:47,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:12:47,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:47,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:47,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:12:47,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:47,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:47,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:12:47,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:12:47,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:47,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:47,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:12:47,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:12:47,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:12:47,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:12:47,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:47,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:12:47,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:12:47,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:12:47,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:12:47,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:12:47,241 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,288 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:12:47,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:12:47,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:12:47,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:12:47,446 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,460 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,473 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,488 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:47,514 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:12:47,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:12:47,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:47,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:12:47,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:12:47,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:47,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:12:47,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:47,652 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:47,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-20 10:12:47,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:47,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:47,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:12:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:47,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:12:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:12:47,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:12:47,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:12:47,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:12:47,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:12:47,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:12:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:12:47,748 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-01-20 10:12:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:12:53,515 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-01-20 10:12:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:12:53,516 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-20 10:12:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:12:53,520 INFO L225 Difference]: With dead ends: 2036 [2019-01-20 10:12:53,521 INFO L226 Difference]: Without dead ends: 2033 [2019-01-20 10:12:53,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:12:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-01-20 10:12:59,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-01-20 10:12:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-01-20 10:12:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-01-20 10:12:59,303 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-01-20 10:12:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:12:59,304 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-01-20 10:12:59,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:12:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-01-20 10:12:59,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:12:59,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:12:59,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:12:59,306 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:12:59,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:12:59,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-01-20 10:12:59,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:12:59,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:59,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:12:59,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:12:59,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:12:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:12:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:12:59,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:59,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:12:59,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:12:59,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:12:59,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:12:59,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:12:59,387 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:12:59,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:12:59,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:12:59,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:12:59,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:12:59,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-20 10:12:59,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:12:59,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-20 10:12:59,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:59,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:59,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:59,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:12:59,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:12:59,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:12:59,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:12:59,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:12:59,544 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:12:59,559 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:59,572 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:59,582 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:59,592 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:12:59,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:12:59,612 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-20 10:12:59,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,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, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-20 10:12:59,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:12:59,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-20 10:12:59,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-01-20 10:12:59,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-20 10:12:59,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-20 10:12:59,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:12:59,961 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:12:59,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-01-20 10:12:59,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:00,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-20 10:13:00,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-01-20 10:13:00,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-01-20 10:13:00,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:00,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-20 10:13:00,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:00,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,337 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:00,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-20 10:13:00,338 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:00,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,415 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:00,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2019-01-20 10:13:00,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:00,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-20 10:13:00,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-01-20 10:13:00,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,550 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:00,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-01-20 10:13:00,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:00,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-20 10:13:00,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:00,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,711 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:00,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-01-20 10:13:00,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:00,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:00,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 93 [2019-01-20 10:13:00,790 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:00,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-20 10:13:00,857 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-01-20 10:13:06,459 WARN L181 SmtUtils]: Spent 5.58 s on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-01-20 10:13:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:06,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:13:06,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:06,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:13:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:13:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:13:06,600 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-01-20 10:13:12,598 WARN L181 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-01-20 10:13:19,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:19,769 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-01-20 10:13:19,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:13:19,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:13:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:19,778 INFO L225 Difference]: With dead ends: 2952 [2019-01-20 10:13:19,778 INFO L226 Difference]: Without dead ends: 2951 [2019-01-20 10:13:19,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:13:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-01-20 10:13:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-01-20 10:13:24,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-20 10:13:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-01-20 10:13:24,960 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-01-20 10:13:24,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:24,960 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-01-20 10:13:24,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:13:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-01-20 10:13:24,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:13:24,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:24,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:13:24,963 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:24,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-20 10:13:24,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:24,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:24,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:13:24,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:24,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:25,258 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-20 10:13:25,471 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-01-20 10:13:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:13:25,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:25,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:25,519 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:13:25,519 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-20 10:13:25,519 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:13:25,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:13:25,521 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:13:25,521 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:13:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:25,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:13:25,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:25,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:25,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:25,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:13:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:25,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:25,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:13:25,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:13:25,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:13:25,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:13:25,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:25,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:25,716 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:25,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:25,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:13:25,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:13:25,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:13:25,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:13:25,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:13:25,762 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:25,784 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:25,795 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:25,805 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:25,814 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:25,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:25,840 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:13:25,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:25,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:13:25,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:13:25,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:13:25,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-20 10:13:26,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:26,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:26,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:26,056 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:26,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2019-01-20 10:13:26,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:26,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:26,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:26,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:26,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:26,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:26,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:26,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:26,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-20 10:13:26,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:26,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:13:26,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-01-20 10:13:26,528 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-20 10:13:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:26,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:26,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:26,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-20 10:13:26,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:26,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:13:26,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:13:26,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:13:26,575 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-01-20 10:13:28,799 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-20 10:13:30,582 WARN L181 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-01-20 10:13:36,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:36,320 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-01-20 10:13:36,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:13:36,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:13:36,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:36,325 INFO L225 Difference]: With dead ends: 1903 [2019-01-20 10:13:36,325 INFO L226 Difference]: Without dead ends: 1896 [2019-01-20 10:13:36,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:13:36,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-20 10:13:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-01-20 10:13:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-01-20 10:13:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-01-20 10:13:42,055 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-01-20 10:13:42,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:42,055 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-01-20 10:13:42,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:13:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-01-20 10:13:42,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:13:42,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:42,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:13:42,058 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:42,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:42,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-01-20 10:13:42,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:42,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:42,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:42,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:42,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:13:42,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:42,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:42,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:13:42,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:13:42,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:42,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:42,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:13:42,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:13:42,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:13:42,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:13:42,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:42,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:13:42,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:13:42,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:13:42,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:13:42,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:13:42,160 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:42,186 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:42,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:42,208 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:42,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:42,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:13:42,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:13:42,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:13:42,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:13:42,346 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:42,360 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:42,374 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:42,389 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:42,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:42,416 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:13:42,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:13:42,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:42,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:42,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:13:42,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:42,493 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:42,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:13:42,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:13:42,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:13:42,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-01-20 10:13:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:42,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:42,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:42,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:13:42,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:42,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:13:42,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:13:42,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:13:42,666 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-01-20 10:13:48,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:13:48,267 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-01-20 10:13:48,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:13:48,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:13:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:13:48,271 INFO L225 Difference]: With dead ends: 1884 [2019-01-20 10:13:48,272 INFO L226 Difference]: Without dead ends: 1877 [2019-01-20 10:13:48,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:13:48,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-01-20 10:13:54,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-01-20 10:13:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-20 10:13:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-01-20 10:13:54,248 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-01-20 10:13:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:13:54,248 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-01-20 10:13:54,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:13:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-01-20 10:13:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:13:54,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:13:54,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:13:54,252 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:13:54,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-01-20 10:13:54,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:13:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:54,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:13:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:13:54,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:13:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:54,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:54,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:13:54,358 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:13:54,358 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-20 10:13:54,359 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:13:54,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:13:54,361 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:13:54,361 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:13:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:13:54,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:13:54,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:13:54,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:13:54,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:13:54,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:13:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:13:54,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:13:54,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:13:54,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:13:54,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:13:54,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:13:54,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:54,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:54,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:54,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:54,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:13:54,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:13:54,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:13:54,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:13:54,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:13:54,604 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:54,906 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:54,917 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:54,925 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:54,935 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:13:54,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:54,961 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:13:54,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:54,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:13:54,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:55,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:55,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-20 10:13:55,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-20 10:13:55,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:13:55,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:13:55,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-20 10:13:55,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:13:55,098 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:13:55,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 94 [2019-01-20 10:13:55,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:13:55,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:13:55,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-20 10:13:55,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-01-20 10:13:55,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:13:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:13:55,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:13:55,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-20 10:13:55,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:13:55,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:13:55,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:13:55,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:13:55,297 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-01-20 10:14:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:14:04,126 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-01-20 10:14:04,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:14:04,126 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:14:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:14:04,133 INFO L225 Difference]: With dead ends: 2991 [2019-01-20 10:14:04,133 INFO L226 Difference]: Without dead ends: 2978 [2019-01-20 10:14:04,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:14:04,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-01-20 10:14:11,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-01-20 10:14:11,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-01-20 10:14:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-01-20 10:14:11,653 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-01-20 10:14:11,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:14:11,653 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-01-20 10:14:11,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:14:11,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-01-20 10:14:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:14:11,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:14:11,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:14:11,657 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:14:11,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:11,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-01-20 10:14:11,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:14:11,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:11,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:11,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:11,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:14:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:11,796 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-20 10:14:11,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:14:11,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:11,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:14:11,843 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:14:11,843 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-20 10:14:11,844 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:14:11,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:14:11,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:14:11,848 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:14:11,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:11,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:14:11,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:11,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:14:11,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:11,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:14:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:11,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:14:11,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:14:11,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:14:11,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:11,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:14:12,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:14:12,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:14:12,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:14:12,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:14:12,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:14:12,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:14:12,095 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,118 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,131 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,140 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,149 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,178 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-20 10:14:12,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,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-01-20 10:14:12,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:12,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:14:12,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-20 10:14:12,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:12,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:14:12,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,345 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:12,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-20 10:14:12,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:12,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-20 10:14:12,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,410 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:12,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-20 10:14:12,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:12,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-01-20 10:14:12,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:12,481 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:12,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 40 treesize of output 96 [2019-01-20 10:14:12,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:12,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-01-20 10:14:12,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-20 10:14:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:12,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:14:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:13,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:14:13,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-20 10:14:13,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:14:13,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:14:13,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:14:13,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:14:13,315 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-01-20 10:14:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:14:23,387 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-01-20 10:14:23,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:14:23,387 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-20 10:14:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:14:23,394 INFO L225 Difference]: With dead ends: 3181 [2019-01-20 10:14:23,395 INFO L226 Difference]: Without dead ends: 3179 [2019-01-20 10:14:23,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:14:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-01-20 10:14:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-01-20 10:14:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-20 10:14:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-01-20 10:14:30,800 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-01-20 10:14:30,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:14:30,800 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-01-20 10:14:30,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:14:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-01-20 10:14:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:14:30,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:14:30,803 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:14:30,803 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:14:30,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:30,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-01-20 10:14:30,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:14:30,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:30,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:30,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:30,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:14:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:14:30,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:14:30,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:14:30,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:14:30,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:14:30,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:14:30,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:14:30,864 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-01-20 10:14:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:14:37,861 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-01-20 10:14:37,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:14:37,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-20 10:14:37,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:14:37,867 INFO L225 Difference]: With dead ends: 2346 [2019-01-20 10:14:37,867 INFO L226 Difference]: Without dead ends: 2337 [2019-01-20 10:14:37,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:14:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-01-20 10:14:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-01-20 10:14:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-20 10:14:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-01-20 10:14:45,342 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-01-20 10:14:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:14:45,342 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-01-20 10:14:45,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:14:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-01-20 10:14:45,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:14:45,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:14:45,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:14:45,346 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:14:45,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:45,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-01-20 10:14:45,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:14:45,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:45,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:45,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:45,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:14:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:14:45,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:45,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:14:45,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:14:45,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:14:45,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:45,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:14:45,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:14:45,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:14:45,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:14:45,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:14:45,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:14:45,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:14:45,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:14:45,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:14:45,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:14:45,695 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,725 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:14:45,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:14:45,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:14:45,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:14:45,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:14:45,775 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,798 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,811 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,822 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,831 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,859 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-20 10:14:45,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14: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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:14:45,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:45,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-20 10:14:45,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:45,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:14:45,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:45,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:45,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:14:46,364 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-20 10:14:46,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,469 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:46,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,471 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-20 10:14:46,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:14:46,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:46,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:46,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-01-20 10:14:46,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,547 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:46,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-20 10:14:46,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:46,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:46,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:14:46,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:46,616 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:14:46,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 40 treesize of output 96 [2019-01-20 10:14:46,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:46,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:46,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-20 10:14:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:46,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:14:46,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:46,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:14:46,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-20 10:14:46,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:14:46,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:14:46,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:14:46,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:14:46,781 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-01-20 10:14:54,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:14:54,662 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-01-20 10:14:54,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:14:54,662 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-20 10:14:54,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:14:54,668 INFO L225 Difference]: With dead ends: 2345 [2019-01-20 10:14:54,668 INFO L226 Difference]: Without dead ends: 2338 [2019-01-20 10:14:54,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:14:54,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-01-20 10:14:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-01-20 10:14:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-01-20 10:14:56,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-01-20 10:14:56,735 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-01-20 10:14:56,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:14:56,735 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-01-20 10:14:56,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:14:56,735 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-01-20 10:14:56,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:14:56,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:14:56,736 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-20 10:14:56,737 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:14:56,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:56,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-01-20 10:14:56,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:14:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:56,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:14:56,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:14:56,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:14:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:14:56,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:56,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:14:56,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:14:56,791 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-20 10:14:56,792 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:14:56,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:14:56,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:14:56,795 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:14:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:14:56,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:14:56,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:14:56,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:14:56,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:14:56,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:14:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:14:56,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:14:56,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:14:56,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:14:56,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:56,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:56,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:14:56,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:56,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:56,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:56,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:14:56,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:14:56,848 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:56,862 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:56,875 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:56,885 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:56,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:56,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:14:56,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:56,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:56,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:14:56,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:56,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,060 INFO L303 Elim1Store]: Index analysis took 112 ms [2019-01-20 10:14:57,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:14:57,060 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:57,092 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:57,101 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:57,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:57,122 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-20 10:14:57,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:14:57,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:57,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:57,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-20 10:14:57,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:14:57,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:57,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:14:57,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-01-20 10:14:57,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-20 10:14:57,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:57,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:57,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-01-20 10:14:57,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:14:57,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, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-20 10:14:57,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:14:57,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:14:57,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-01-20 10:14:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:57,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:14:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:14:57,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:14:57,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:14:57,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:14:57,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:14:57,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:14:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:14:57,411 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-01-20 10:14:59,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:14:59,634 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-01-20 10:14:59,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:14:59,634 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:14:59,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:14:59,636 INFO L225 Difference]: With dead ends: 480 [2019-01-20 10:14:59,636 INFO L226 Difference]: Without dead ends: 477 [2019-01-20 10:14:59,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:14:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-20 10:15:00,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-01-20 10:15:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-20 10:15:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-01-20 10:15:00,530 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-01-20 10:15:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:00,530 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-01-20 10:15:00,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:15:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-01-20 10:15:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:15:00,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:00,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:15:00,531 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:00,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:00,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-01-20 10:15:00,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:00,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:00,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:00,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:00,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:00,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:15:00,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:00,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:15:00,585 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:15:00,585 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-20 10:15:00,585 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:15:00,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:15:00,587 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:15:00,587 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:15:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:00,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:15:00,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:00,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:15:00,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:00,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:15:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:00,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:15:00,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:15:00,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:15:00,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:15:00,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:15:00,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:15:00,629 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:00,653 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:00,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:00,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:00,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:00,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:15:00,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:15:00,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:15:00,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:15:00,800 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:00,814 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:00,827 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:00,842 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:00,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:00,869 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:15:00,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:15:00,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:00,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:00,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:15:00,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:15:00,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:00,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:00,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:15:00,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:00,990 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:00,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-20 10:15:00,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:01,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-01-20 10:15:01,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:15:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:01,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:15:01,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:01,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:15:01,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:15:01,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:15:01,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:15:01,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:15:01,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:15:01,078 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-01-20 10:15:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:15:02,893 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-01-20 10:15:02,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:15:02,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-20 10:15:02,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:15:02,895 INFO L225 Difference]: With dead ends: 250 [2019-01-20 10:15:02,895 INFO L226 Difference]: Without dead ends: 243 [2019-01-20 10:15:02,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:15:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-20 10:15:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-01-20 10:15:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-20 10:15:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-01-20 10:15:04,370 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-01-20 10:15:04,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:04,370 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-01-20 10:15:04,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:15:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-01-20 10:15:04,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:15:04,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:04,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:15:04,371 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:04,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:04,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-01-20 10:15:04,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:04,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:04,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:04,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:04,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:15:04,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:04,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:15:04,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:15:04,460 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-20 10:15:04,461 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:15:04,461 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:15:04,462 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:15:04,462 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:15:04,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:04,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:15:04,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:04,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:15:04,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:04,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:15:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:04,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:15:04,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:15:04,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:15:04,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:15:04,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:15:04,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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-20 10:15:04,505 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,521 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-20 10:15:04,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-20 10:15:04,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-20 10:15:04,608 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,616 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,624 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:04,642 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-20 10:15:04,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:15:04,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-20 10:15:04,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-20 10:15:04,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:04,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-20 10:15:04,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:04,734 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:04,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-01-20 10:15:04,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:04,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:04,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-20 10:15:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:04,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:15:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:04,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:15:04,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:15:04,812 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:15:04,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:15:04,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:15:04,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:15:04,813 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-01-20 10:15:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:15:07,826 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-01-20 10:15:07,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:15:07,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:15:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:15:07,828 INFO L225 Difference]: With dead ends: 372 [2019-01-20 10:15:07,828 INFO L226 Difference]: Without dead ends: 362 [2019-01-20 10:15:07,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:15:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-20 10:15:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-01-20 10:15:10,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-20 10:15:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-01-20 10:15:10,115 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-01-20 10:15:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:10,115 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-01-20 10:15:10,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:15:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-01-20 10:15:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:15:10,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:10,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:15:10,117 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-01-20 10:15:10,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:10,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:10,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:10,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:10,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:10,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:15:10,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:15:10,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:15:10,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:10,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:15:10,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:15:10,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:15:10,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:15:10,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:15:10,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:15:10,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:15:10,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:15:10,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:15:10,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:15:10,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:15:10,224 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:10,249 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:10,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:10,273 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:10,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:10,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:15:10,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:15:10,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:15:10,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:15:10,397 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:10,411 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:10,425 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:10,440 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:10,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:10,466 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:15:10,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:15:10,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:10,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-01-20 10:15:10,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:15:10,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,538 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:10,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:15:10,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:15:10,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:15:10,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-20 10:15:10,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:10,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:15:10,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:10,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-01-20 10:15:10,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-20 10:15:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:10,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:15:10,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:10,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:15:10,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:15:10,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:15:10,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:15:10,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:15:10,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:15:10,783 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-01-20 10:15:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:15:13,599 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-01-20 10:15:13,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:15:13,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:15:13,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:15:13,601 INFO L225 Difference]: With dead ends: 332 [2019-01-20 10:15:13,601 INFO L226 Difference]: Without dead ends: 325 [2019-01-20 10:15:13,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:15:13,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-20 10:15:15,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-01-20 10:15:15,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-20 10:15:15,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-01-20 10:15:15,946 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-01-20 10:15:15,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:15,946 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-01-20 10:15:15,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:15:15,947 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-01-20 10:15:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:15:15,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:15,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:15:15,948 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-01-20 10:15:15,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:15,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:15:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:15,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:15:16,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:16,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:15:16,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:15:16,009 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-20 10:15:16,010 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:15:16,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:15:16,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:15:16,012 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:15:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:16,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:15:16,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:16,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:15:16,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:16,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:15:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:16,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:15:16,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:15:16,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,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 36 treesize of output 49 [2019-01-20 10:15:16,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:15:16,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:15:16,129 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:15:16,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:15:16,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:15:16,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:15:16,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:15:16,205 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,226 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,238 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,247 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,256 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:16,282 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:15:16,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:15:16,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,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-01-20 10:15:16,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:15:16,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,372 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:16,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:15:16,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:16,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-20 10:15:16,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:16,420 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:16,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-20 10:15:16,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:16,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:16,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-20 10:15:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:16,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:15:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:16,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:15:16,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:15:16,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:15:16,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:15:16,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:15:16,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:15:16,523 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-01-20 10:15:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:15:19,287 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-01-20 10:15:19,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:15:19,287 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:15:19,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:15:19,289 INFO L225 Difference]: With dead ends: 294 [2019-01-20 10:15:19,289 INFO L226 Difference]: Without dead ends: 287 [2019-01-20 10:15:19,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:15:19,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-20 10:15:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-01-20 10:15:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-20 10:15:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-01-20 10:15:21,592 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-01-20 10:15:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:21,592 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-01-20 10:15:21,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:15:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-01-20 10:15:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:15:21,593 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:21,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:15:21,593 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:21,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:21,594 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-01-20 10:15:21,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:21,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:21,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:21,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:21,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:15:21,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:21,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:15:21,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:15:21,704 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-20 10:15:21,704 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:15:21,705 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:15:21,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:15:21,707 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:15:21,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:21,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:15:21,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:21,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:15:21,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:21,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:15:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:21,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:15:21,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:15:21,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:15:21,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:15:21,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:15:21,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:15:21,749 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:21,774 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:21,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:21,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:21,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:21,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:15:21,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:15:21,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:15:21,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:21,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:15:21,916 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:21,931 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:21,944 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:21,959 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:21,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:21,985 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:15:22,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:15:22,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:22,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:22,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-20 10:15:22,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:15:22,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:15:22,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:15:22,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-01-20 10:15:22,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,276 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:22,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 69 [2019-01-20 10:15:22,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:22,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:22,336 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:22,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 50 treesize of output 98 [2019-01-20 10:15:22,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:22,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:15:22,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-01-20 10:15:24,458 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 49 [2019-01-20 10:15:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:24,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:15:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:24,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:15:24,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-20 10:15:24,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:15:24,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:15:24,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:15:24,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:15:24,524 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-01-20 10:15:24,791 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-20 10:15:25,034 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-01-20 10:15:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:15:28,022 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-01-20 10:15:28,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:15:28,022 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:15:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:15:28,024 INFO L225 Difference]: With dead ends: 364 [2019-01-20 10:15:28,024 INFO L226 Difference]: Without dead ends: 357 [2019-01-20 10:15:28,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:15:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-20 10:15:30,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-01-20 10:15:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-20 10:15:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-01-20 10:15:30,453 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-01-20 10:15:30,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:30,453 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-01-20 10:15:30,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:15:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-01-20 10:15:30,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:15:30,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:30,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:15:30,454 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:30,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:30,455 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-01-20 10:15:30,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:30,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:30,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:30,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:30,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:15:30,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:30,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:15:30,562 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:15:30,563 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-20 10:15:30,563 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:15:30,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:15:30,565 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:15:30,565 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:15:30,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:30,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:15:30,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:30,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:15:30,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:30,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:15:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:30,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:15:30,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-01-20 10:15:30,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:15:30,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:15:30,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:15:30,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:15:30,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:30,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:30,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:30,659 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:30,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:30,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:15:30,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:15:30,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:15:30,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:15:30,783 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:30,797 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:30,810 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:30,839 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:30,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:30,866 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:15:30,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:15:30,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:30,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:30,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:15:30,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-20 10:15:30,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:30,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:30,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-20 10:15:30,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:30,997 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:30,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:15:30,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:31,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:31,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:15:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:31,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:15:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:31,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:15:31,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:15:31,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:15:31,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:15:31,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:15:31,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:15:31,088 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-01-20 10:15:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:15:34,036 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-01-20 10:15:34,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:15:34,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-20 10:15:34,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:15:34,037 INFO L225 Difference]: With dead ends: 319 [2019-01-20 10:15:34,037 INFO L226 Difference]: Without dead ends: 312 [2019-01-20 10:15:34,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:15:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-20 10:15:36,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-01-20 10:15:36,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-20 10:15:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-01-20 10:15:36,847 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-01-20 10:15:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:36,848 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-01-20 10:15:36,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:15:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-01-20 10:15:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:15:36,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:36,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:15:36,849 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:36,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-01-20 10:15:36,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:36,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:36,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:36,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:36,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:15:36,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:36,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:15:36,957 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:15:36,957 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-20 10:15:36,958 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:15:36,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:15:36,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:15:36,960 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:15:36,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:36,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:15:36,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:36,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:15:36,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:36,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:15:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:36,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:15:36,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:15:36,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:36,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:36,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:15:37,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:15:37,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:15:37,079 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:15:37,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:15:37,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:15:37,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:15:37,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:15:37,169 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,191 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,203 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,212 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,221 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:37,248 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:15:37,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:15:37,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:15:37,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:15:37,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-20 10:15:37,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-01-20 10:15:37,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,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 62 treesize of output 88 [2019-01-20 10:15:37,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:15:37,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-01-20 10:15:37,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,627 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:37,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-20 10:15:37,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,687 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:37,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:37,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 37 treesize of output 65 [2019-01-20 10:15:37,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:37,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:15:37,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-20 10:15:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:37,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:15:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:37,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:15:37,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-20 10:15:37,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:15:37,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:15:37,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:15:37,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:15:37,839 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-01-20 10:15:39,183 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-20 10:15:42,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:15:42,076 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-01-20 10:15:42,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:15:42,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:15:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:15:42,078 INFO L225 Difference]: With dead ends: 392 [2019-01-20 10:15:42,078 INFO L226 Difference]: Without dead ends: 386 [2019-01-20 10:15:42,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:15:42,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-20 10:15:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-01-20 10:15:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-20 10:15:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-01-20 10:15:45,091 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-01-20 10:15:45,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:45,091 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-01-20 10:15:45,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:15:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-01-20 10:15:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:15:45,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:45,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:15:45,092 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:45,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-20 10:15:45,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:45,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:45,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:45,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:45,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:15:45,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:15:45,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-20 10:15:45,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:15:45,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:15:45,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:15:45,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:15:45,156 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-01-20 10:15:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:15:48,024 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-01-20 10:15:48,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:15:48,024 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-20 10:15:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:15:48,025 INFO L225 Difference]: With dead ends: 320 [2019-01-20 10:15:48,026 INFO L226 Difference]: Without dead ends: 315 [2019-01-20 10:15:48,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:15:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-20 10:15:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-01-20 10:15:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-20 10:15:51,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-01-20 10:15:51,029 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-01-20 10:15:51,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:15:51,029 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-01-20 10:15:51,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:15:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-01-20 10:15:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:15:51,030 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:15:51,030 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:15:51,030 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:15:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:15:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-01-20 10:15:51,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:15:51,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:51,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:15:51,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:15:51,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:15:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:15:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:15:51,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:51,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:15:51,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:15:51,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:15:51,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:15:51,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:15:51,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:15:51,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:15:51,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:15:51,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:15:51,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:15:51,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:15:51,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:15:51,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:15:51,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:15:51,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:15:51,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:15:51,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:15:51,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:15:51,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:15:51,292 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,314 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,325 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,335 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,344 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:51,370 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:15:51,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:15:51,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:51,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-20 10:15:51,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-20 10:15:51,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:51,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-01-20 10:15:51,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,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, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:15:51,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:15:51,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:15:51,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-20 10:15:51,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:15:51,736 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:15:51,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-20 10:15:51,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:15:51,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:15:51,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-20 10:15:51,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:51,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:15:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:15:51,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:15:51,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:15:51,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:15:51,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:15:51,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:15:51,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:15:51,862 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-01-20 10:15:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:15:57,986 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-01-20 10:15:57,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:15:57,986 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:15:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:15:57,988 INFO L225 Difference]: With dead ends: 601 [2019-01-20 10:15:57,988 INFO L226 Difference]: Without dead ends: 591 [2019-01-20 10:15:57,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:15:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-20 10:16:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-01-20 10:16:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-20 10:16:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-01-20 10:16:02,974 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-01-20 10:16:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:16:02,974 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-01-20 10:16:02,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:16:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-01-20 10:16:02,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:16:02,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:16:02,975 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:16:02,976 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:16:02,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-01-20 10:16:02,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:16:02,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:02,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:16:02,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:02,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:16:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:16:03,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:03,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:16:03,046 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:16:03,046 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-20 10:16:03,047 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:16:03,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:16:03,049 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:16:03,049 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:16:03,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:03,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:16:03,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:03,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:16:03,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:03,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:16:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:03,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:16:03,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:16:03,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:16:03,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:16:03,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:16:03,207 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:03,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:03,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:03,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:03,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:16:03,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:16:03,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:16:03,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:16:03,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:16:03,296 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:03,316 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:03,328 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:03,337 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:03,346 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:03,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:03,372 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:16:03,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:16:03,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:03,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:03,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:16:03,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,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, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-01-20 10:16:03,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:03,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-01-20 10:16:03,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-20 10:16:03,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,512 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:16:03,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:03,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 93 [2019-01-20 10:16:03,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:16:03,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:16:03,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-20 10:16:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:03,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:16:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:03,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:16:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:16:03,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:16:03,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:16:03,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:16:03,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:16:03,751 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-01-20 10:16:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:16:13,163 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-01-20 10:16:13,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:16:13,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-20 10:16:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:16:13,165 INFO L225 Difference]: With dead ends: 731 [2019-01-20 10:16:13,165 INFO L226 Difference]: Without dead ends: 718 [2019-01-20 10:16:13,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:16:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-01-20 10:16:21,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-01-20 10:16:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-20 10:16:21,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-01-20 10:16:21,335 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-01-20 10:16:21,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:16:21,335 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-01-20 10:16:21,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:16:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-01-20 10:16:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:16:21,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:16:21,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:16:21,336 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:16:21,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:21,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-01-20 10:16:21,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:16:21,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:21,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:21,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:21,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:16:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:21,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:16:21,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:21,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:16:21,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:16:21,412 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-20 10:16:21,412 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:16:21,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:16:21,415 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:16:21,416 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:16:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:21,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:16:21,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:21,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:16:21,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:21,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:16:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:21,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:16:21,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:16:21,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:16:21,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:16:21,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:16:21,543 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,574 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:16:21,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:16:21,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:16:21,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:16:21,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:16:21,628 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,662 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,674 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,683 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,693 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:21,719 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:16:21,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:16:21,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-01-20 10:16:21,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-20 10:16:21,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:21,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-20 10:16:21,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,863 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:16:21,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:16:21,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:21,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-20 10:16:21,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:21,914 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:16:21,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-01-20 10:16:21,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:21,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:21,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-01-20 10:16:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:21,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:16:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:22,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:16:22,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:16:22,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:16:22,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:16:22,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:16:22,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:16:22,043 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-01-20 10:16:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:16:31,713 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-01-20 10:16:31,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:16:31,714 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:16:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:16:31,715 INFO L225 Difference]: With dead ends: 480 [2019-01-20 10:16:31,715 INFO L226 Difference]: Without dead ends: 473 [2019-01-20 10:16:31,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:16:31,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-20 10:16:34,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-01-20 10:16:34,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-20 10:16:34,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-01-20 10:16:34,911 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-01-20 10:16:34,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:16:34,911 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-01-20 10:16:34,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:16:34,911 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-01-20 10:16:34,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:16:34,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:16:34,912 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:16:34,912 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:16:34,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:34,913 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-20 10:16:34,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:16:34,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:34,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:34,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:34,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:16:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:16:35,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:35,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:16:35,014 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:16:35,014 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-20 10:16:35,015 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:16:35,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:16:35,018 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:16:35,018 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:16:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:35,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:16:35,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:35,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:16:35,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:35,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:16:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:35,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:16:35,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:16:35,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:16:35,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:16:35,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:16:35,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:16:35,069 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,117 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:16:35,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,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 36 treesize of output 49 [2019-01-20 10:16:35,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:16:35,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:16:35,240 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,254 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,277 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,292 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:35,318 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:16:35,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-20 10:16:35,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:35,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:16:35,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:16:35,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:35,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-20 10:16:35,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,454 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:16:35,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:35,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-20 10:16:35,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:35,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:35,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:16:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:35,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:16:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:35,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:16:35,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:16:35,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:16:35,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:16:35,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:16:35,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:16:35,543 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-01-20 10:16:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:16:40,659 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-01-20 10:16:40,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:16:40,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-20 10:16:40,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:16:40,660 INFO L225 Difference]: With dead ends: 258 [2019-01-20 10:16:40,660 INFO L226 Difference]: Without dead ends: 243 [2019-01-20 10:16:40,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:16:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-20 10:16:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-01-20 10:16:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-20 10:16:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-01-20 10:16:44,965 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-01-20 10:16:44,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:16:44,965 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-01-20 10:16:44,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:16:44,966 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-01-20 10:16:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:16:44,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:16:44,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:16:44,967 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:16:44,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-01-20 10:16:44,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:16:44,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:44,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:44,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:44,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:16:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:16:45,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:45,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:16:45,115 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:16:45,115 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-20 10:16:45,116 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:16:45,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:16:45,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:16:45,118 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:16:45,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:45,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:16:45,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:45,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:16:45,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:45,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:16:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:45,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:16:45,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:16:45,137 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:16:45,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:16:45,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:16:45,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:16:45,179 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,203 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,227 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,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 43 treesize of output 39 [2019-01-20 10:16:45,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:16:45,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:16:45,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:16:45,361 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,375 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,388 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,403 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,429 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-20 10:16:45,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:16:45,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:45,492 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-20 10:16:45,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,530 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:16:45,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-01-20 10:16:45,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:16:45,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:16:45,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-20 10:16:45,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,681 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:16:45,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-01-20 10:16:45,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 90 [2019-01-20 10:16:45,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:16:45,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-01-20 10:16:45,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,854 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:16:45,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-20 10:16:45,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:45,935 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:16:45,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 43 treesize of output 63 [2019-01-20 10:16:45,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:45,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:16:45,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-01-20 10:16:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:46,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:16:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:46,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:16:46,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:16:46,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:16:46,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:16:46,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:16:46,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:16:46,082 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-01-20 10:16:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:16:52,069 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-01-20 10:16:52,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:16:52,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:16:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:16:52,071 INFO L225 Difference]: With dead ends: 295 [2019-01-20 10:16:52,071 INFO L226 Difference]: Without dead ends: 284 [2019-01-20 10:16:52,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:16:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-20 10:16:56,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-01-20 10:16:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-20 10:16:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-01-20 10:16:56,648 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-01-20 10:16:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:16:56,648 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-01-20 10:16:56,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:16:56,648 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-01-20 10:16:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:16:56,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:16:56,648 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:16:56,649 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:16:56,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:56,649 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-20 10:16:56,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:16:56,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:56,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:56,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:16:56,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:16:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:16:56,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:56,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:16:56,723 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:16:56,723 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-20 10:16:56,725 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:16:56,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:16:56,726 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:16:56,727 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:16:56,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:16:56,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:16:56,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:16:56,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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:16:56,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:16:56,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:16:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:16:56,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:16:56,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:16:56,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:16:56,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:16:56,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:16:56,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:16:56,771 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:56,796 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:56,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:56,818 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:56,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:56,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:16:56,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:16:56,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:16:56,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:56,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:16:56,942 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:56,957 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:56,988 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:57,002 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:16:57,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:57,028 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-20 10:16:57,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-20 10:16:57,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:57,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:57,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-20 10:16:57,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-20 10:16:57,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:16:57,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:16:57,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-20 10:16:57,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:16:57,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-20 10:16:57,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:16:57,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:16:57,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-01-20 10:16:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:57,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:16:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:16:57,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:16:57,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:16:57,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:16:57,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:16:57,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:16:57,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:16:57,364 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-01-20 10:17:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:17:04,085 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-01-20 10:17:04,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:17:04,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-20 10:17:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:17:04,087 INFO L225 Difference]: With dead ends: 328 [2019-01-20 10:17:04,087 INFO L226 Difference]: Without dead ends: 315 [2019-01-20 10:17:04,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:17:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-20 10:17:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-01-20 10:17:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-20 10:17:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-01-20 10:17:10,598 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-01-20 10:17:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:17:10,599 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-01-20 10:17:10,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:17:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-01-20 10:17:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:17:10,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:17:10,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:17:10,599 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:17:10,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:17:10,600 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-20 10:17:10,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:17:10,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:17:10,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:17:10,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:17:10,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:17:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:17:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:17:10,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:17:10,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:17:10,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:17:10,735 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-20 10:17:10,736 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:17:10,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:17:10,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:17:10,738 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:17:10,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:17:10,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:17:10,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:17:10,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:17:10,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:17:10,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:17:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:17:10,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:17:10,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:17:10,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:17:10,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:17:10,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:10,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:17:10,908 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:10,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:10,943 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:10,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:10,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:17:10,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:17:10,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:17:10,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:17:10,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:17:10,994 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:11,017 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:11,030 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:11,040 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:11,049 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:11,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:11,078 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:17:11,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:17:11,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:11,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:11,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:17:11,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-20 10:17:11,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:11,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:11,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-20 10:17:11,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,240 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:17:11,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:11,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:17:11,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:11,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:11,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-20 10:17:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:17:11,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:17:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:17:11,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:17:11,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:17:11,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:17:11,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:17:11,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:17:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:17:11,359 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-01-20 10:17:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:17:20,438 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-01-20 10:17:20,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:17:20,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-20 10:17:20,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:17:20,440 INFO L225 Difference]: With dead ends: 326 [2019-01-20 10:17:20,440 INFO L226 Difference]: Without dead ends: 313 [2019-01-20 10:17:20,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:17:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-20 10:17:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-01-20 10:17:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-20 10:17:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-01-20 10:17:28,412 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-01-20 10:17:28,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:17:28,412 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-01-20 10:17:28,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:17:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-01-20 10:17:28,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:17:28,413 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:17:28,413 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:17:28,413 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:17:28,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:17:28,413 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-01-20 10:17:28,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:17:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:17:28,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:17:28,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:17:28,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:17:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:17:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-20 10:17:28,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:17:28,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:17:28,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:17:28,499 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-20 10:17:28,500 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:17:28,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:17:28,501 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:17:28,501 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:17:28,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:17:28,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:17:28,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:17:28,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:17:28,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:17:28,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:17:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:17:28,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:17:28,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:17:28,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:17:28,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:28,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:28,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:17:28,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:28,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:28,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:28,822 INFO L303 Elim1Store]: Index analysis took 118 ms [2019-01-20 10:17:28,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:17:28,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:28,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:28,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:28,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:28,973 INFO L303 Elim1Store]: Index analysis took 149 ms [2019-01-20 10:17:28,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 27 treesize of output 62 [2019-01-20 10:17:28,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,133 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,156 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:17:29,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:17:29,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:17:29,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:17:29,276 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,290 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,304 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,318 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:29,344 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:17:29,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:17:29,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:17:29,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:17:29,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-20 10:17:29,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,520 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:17:29,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 58 [2019-01-20 10:17:29,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:29,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-01-20 10:17:29,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-20 10:17:29,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:29,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-20 10:17:29,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:29,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-20 10:17:29,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:29,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:29,637 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-01-20 10:17:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:17:29,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:17:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:17:29,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:17:29,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:17:29,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:17:29,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:17:29,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:17:29,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:17:29,723 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-01-20 10:17:40,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:17:40,764 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-01-20 10:17:40,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:17:40,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-20 10:17:40,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:17:40,766 INFO L225 Difference]: With dead ends: 400 [2019-01-20 10:17:40,767 INFO L226 Difference]: Without dead ends: 393 [2019-01-20 10:17:40,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:17:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-20 10:17:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-01-20 10:17:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-20 10:17:50,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-01-20 10:17:50,794 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-01-20 10:17:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:17:50,794 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-01-20 10:17:50,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:17:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-01-20 10:17:50,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:17:50,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:17:50,795 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:17:50,795 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:17:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:17:50,795 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-01-20 10:17:50,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:17:50,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:17:50,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:17:50,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:17:50,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:17:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:17:50,948 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-01-20 10:17:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-20 10:17:51,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:17:51,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:17:51,003 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:17:51,003 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-01-20 10:17:51,003 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:17:51,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:17:51,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:17:51,005 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:17:51,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:17:51,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:17:51,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:17:51,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:17:51,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:17:51,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:17:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:17:51,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:17:51,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:17:51,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:17:51,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:17:51,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:17:51,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:17:51,064 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,090 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,103 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:17:51,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:17:51,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:17:51,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:17:51,243 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,257 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,270 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,285 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:17:51,312 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-20 10:17:51,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:17:51,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:17:51,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:17:51,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-20 10:17:51,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,501 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:17:51,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2019-01-20 10:17:51,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,562 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:17:51,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2019-01-20 10:17:51,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:17:51,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-01-20 10:17:51,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 82 [2019-01-20 10:17:51,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,708 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:17:51,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-20 10:17:51,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:51,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:17:51,748 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-01-20 10:17:51,923 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-01-20 10:17:51,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:51,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 102 [2019-01-20 10:17:51,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:52,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:52,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:52,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:52,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:52,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:52,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:17:52,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-01-20 10:17:52,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:17:52,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:17:52,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-20 10:17:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:17:52,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:17:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:17:52,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:17:52,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:17:52,159 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:17:52,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:17:52,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:17:52,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:17:52,159 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-01-20 10:18:04,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:18:04,079 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-01-20 10:18:04,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:18:04,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-20 10:18:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:18:04,082 INFO L225 Difference]: With dead ends: 441 [2019-01-20 10:18:04,082 INFO L226 Difference]: Without dead ends: 428 [2019-01-20 10:18:04,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:18:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-01-20 10:18:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-01-20 10:18:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-20 10:18:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-01-20 10:18:13,983 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-01-20 10:18:13,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:18:13,983 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-01-20 10:18:13,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:18:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-01-20 10:18:13,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:18:13,984 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:18:13,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:18:13,984 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:18:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:18:13,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-01-20 10:18:13,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:18:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:18:13,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:18:13,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:18:13,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:18:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:18:14,247 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-20 10:18:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-20 10:18:14,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:18:14,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:18:14,328 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:18:14,328 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-20 10:18:14,329 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:18:14,329 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:18:14,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:18:14,330 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:18:14,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:18:14,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:18:14,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:18:14,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:18:14,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:18:14,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:18:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:18:14,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:18:14,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:18:14,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:18:14,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:18:14,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:18:14,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:18:14,372 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,401 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:18:14,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:18:14,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:18:14,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:18:14,549 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,563 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,576 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:18:14,616 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:18:14,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:18:14,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:18:14,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:18:14,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-20 10:18:14,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2019-01-20 10:18:14,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 96 [2019-01-20 10:18:14,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:14,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:18:14,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-01-20 10:18:14,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:14,984 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:18:14,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-20 10:18:14,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:15,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,049 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:18:15,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-01-20 10:18:15,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:15,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:18:15,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-01-20 10:18:15,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,138 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:18:15,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 83 [2019-01-20 10:18:15,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:15,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:15,200 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:18:15,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2019-01-20 10:18:15,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:15,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:18:15,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-01-20 10:18:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:18:15,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:18:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:18:15,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:18:15,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:18:15,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:18:15,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:18:15,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:18:15,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:18:15,365 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-01-20 10:18:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:18:34,666 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-01-20 10:18:34,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:18:34,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:18:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:18:34,668 INFO L225 Difference]: With dead ends: 685 [2019-01-20 10:18:34,668 INFO L226 Difference]: Without dead ends: 677 [2019-01-20 10:18:34,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:18:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-01-20 10:18:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-01-20 10:18:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-01-20 10:18:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-01-20 10:18:49,438 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-01-20 10:18:49,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:18:49,439 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-01-20 10:18:49,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:18:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-01-20 10:18:49,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:18:49,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:18:49,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:18:49,440 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:18:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:18:49,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-01-20 10:18:49,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:18:49,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:18:49,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:18:49,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:18:49,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:18:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:18:49,644 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-01-20 10:18:49,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:18:49,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:18:49,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:18:49,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:18:49,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:18:49,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:18:49,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:18:49,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:18:49,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:18:49,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:18:49,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:18:49,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:18:49,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:18:49,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:18:49,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:18:49,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:49,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:18:49,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:49,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:49,875 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:49,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:49,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:18:49,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:18:49,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:18:49,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:18:49,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:18:49,923 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:49,944 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:49,955 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:49,964 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:49,973 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:18:49,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:18:50,000 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:18:50,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-20 10:18:50,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:18:50,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:18:50,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-20 10:18:50,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-20 10:18:50,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:50,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,297 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:18:50,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-01-20 10:18:50,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:50,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:18:50,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-01-20 10:18:50,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,416 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:18:50,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-01-20 10:18:50,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:50,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-01-20 10:18:50,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:50,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:18:50,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-01-20 10:18:50,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-01-20 10:18:50,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:50,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:18:50,628 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:18:50,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 110 [2019-01-20 10:18:50,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:18:50,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:18:50,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-20 10:18:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:18:50,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:18:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:18:50,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:18:50,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-20 10:18:50,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:18:50,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:18:50,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:18:50,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:18:50,799 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-01-20 10:18:54,090 WARN L181 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-01-20 10:18:54,825 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-20 10:19:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:19:08,684 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-01-20 10:19:08,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:19:08,684 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-20 10:19:08,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:19:08,685 INFO L225 Difference]: With dead ends: 550 [2019-01-20 10:19:08,685 INFO L226 Difference]: Without dead ends: 543 [2019-01-20 10:19:08,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:19:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-20 10:19:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-01-20 10:19:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:19:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-20 10:19:11,585 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-01-20 10:19:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:19:11,586 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-20 10:19:11,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:19:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-20 10:19:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:19:11,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:19:11,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:19:11,586 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:19:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:19:11,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-01-20 10:19:11,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:19:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:11,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:19:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:11,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:19:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:19:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:19:11,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:11,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:19:11,716 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-20 10:19:11,716 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-20 10:19:11,716 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:19:11,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:19:11,718 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:19:11,718 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:19:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:19:11,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:19:11,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:11,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:19:11,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:19:11,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:19:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:19:11,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:19:11,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-20 10:19:11,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-20 10:19:11,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-20 10:19:11,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:11,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-20 10:19:11,867 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:11,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:11,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:11,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:11,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:19:11,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-20 10:19:11,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-20 10:19:11,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:19:11,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-20 10:19:11,976 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:12,370 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:12,581 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:12,753 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:12,903 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:13,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:13,140 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-20 10:19:13,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-20 10:19:13,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:13,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:13,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-20 10:19:13,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:19:13,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:13,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:13,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-20 10:19:13,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,300 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:13,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-20 10:19:13,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:13,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:13,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-20 10:19:13,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:13,566 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:13,567 INFO L303 Elim1Store]: Index analysis took 204 ms [2019-01-20 10:19:13,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-20 10:19:13,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:13,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:13,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:19:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:13,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:19:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:13,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:19:13,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-20 10:19:13,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:19:13,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:19:13,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:19:13,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:19:13,988 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-20 10:19:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:19:19,651 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-01-20 10:19:19,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:19:19,651 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-20 10:19:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:19:19,652 INFO L225 Difference]: With dead ends: 67 [2019-01-20 10:19:19,652 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 10:19:19,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:19:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 10:19:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-01-20 10:19:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 10:19:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-01-20 10:19:22,751 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-01-20 10:19:22,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:19:22,752 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-01-20 10:19:22,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:19:22,752 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-01-20 10:19:22,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:19:22,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:19:22,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:19:22,752 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:19:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:19:22,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-01-20 10:19:22,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:19:22,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:22,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:19:22,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:22,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:19:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:19:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-20 10:19:22,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:22,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:19:22,889 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-20 10:19:22,889 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-20 10:19:22,890 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:19:22,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:19:22,891 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:19:22,891 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:19:22,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:19:22,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:19:22,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:22,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:19:22,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:19:22,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:19:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:19:22,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:19:22,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:19:22,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:22,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:22,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:19:22,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:22,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:22,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:22,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:22,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:19:23,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:19:23,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,024 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:19:23,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:19:23,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:19:23,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:19:23,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:19:23,086 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,107 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,119 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,128 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,137 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,163 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-20 10:19:23,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-20 10:19:23,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:23,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-20 10:19:23,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-20 10:19:23,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:19:23,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:19:23,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-01-20 10:19:23,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,423 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:23,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-20 10:19:23,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,486 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:23,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 104 [2019-01-20 10:19:23,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-20 10:19:23,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-01-20 10:19:23,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,599 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:23,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 109 [2019-01-20 10:19:23,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:23,665 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:23,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-20 10:19:23,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:23,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:19:23,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-01-20 10:19:23,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:23,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:19:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:23,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:19:23,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:19:23,836 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:19:23,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:19:23,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:19:23,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:19:23,837 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-01-20 10:19:29,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:19:29,859 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-01-20 10:19:29,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:19:29,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-20 10:19:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:19:29,860 INFO L225 Difference]: With dead ends: 74 [2019-01-20 10:19:29,860 INFO L226 Difference]: Without dead ends: 59 [2019-01-20 10:19:29,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:19:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-20 10:19:33,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-01-20 10:19:33,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:19:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-20 10:19:33,263 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-01-20 10:19:33,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:19:33,263 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-20 10:19:33,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:19:33,263 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-20 10:19:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:19:33,263 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:19:33,263 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:19:33,263 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:19:33,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:19:33,264 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-01-20 10:19:33,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:19:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:33,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:19:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:33,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:19:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:19:33,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:19:33,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:33,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:19:33,397 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-20 10:19:33,398 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-01-20 10:19:33,398 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:19:33,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:19:33,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:19:33,400 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:19:33,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:19:33,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:19:33,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19: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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:19:33,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:19:33,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:19:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:19:33,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:19:33,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-20 10:19:33,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-20 10:19:33,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-20 10:19:33,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-20 10:19:33,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:19:33,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:19:33,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-20 10:19:33,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-20 10:19:33,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-20 10:19:33,589 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,611 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,623 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,632 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,641 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:33,668 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-20 10:19:33,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:19:33,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:33,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-20 10:19:33,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:19:33,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:33,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-20 10:19:33,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:33,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-01-20 10:19:33,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:33,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-20 10:19:33,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:33,932 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:33,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-20 10:19:33,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:33,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:33,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-20 10:19:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:33,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:19:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:34,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:19:34,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-20 10:19:34,034 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:19:34,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:19:34,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:19:34,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:19:34,034 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-20 10:19:41,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:19:41,057 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-01-20 10:19:41,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:19:41,058 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-20 10:19:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:19:41,058 INFO L225 Difference]: With dead ends: 80 [2019-01-20 10:19:41,058 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:19:41,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:19:41,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:19:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-01-20 10:19:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-20 10:19:47,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-01-20 10:19:47,196 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-01-20 10:19:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:19:47,196 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-01-20 10:19:47,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:19:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-01-20 10:19:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-20 10:19:47,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:19:47,197 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:19:47,197 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:19:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:19:47,197 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-01-20 10:19:47,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:19:47,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:47,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:19:47,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:19:47,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:19:47,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:19:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-20 10:19:47,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:47,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:19:47,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:19:47,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:19:47,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:19:47,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:19:47,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:19:47,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:19:47,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:19:47,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:19:47,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:19:47,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-01-20 10:19:47,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-20 10:19:47,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-20 10:19:47,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-01-20 10:19:47,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-20 10:19:47,341 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,357 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,376 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-01-20 10:19:47,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-01-20 10:19:47,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-01-20 10:19:47,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-20 10:19:47,425 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,432 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,439 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,446 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-20 10:19:47,462 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-01-20 10:19:47,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-20 10:19:47,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:19:47,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-20 10:19:47,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-20 10:19:47,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-20 10:19:47,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-20 10:19:47,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-20 10:19:47,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-01-20 10:19:47,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-20 10:19:47,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-20 10:19:47,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-20 10:19:47,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-01-20 10:19:47,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-20 10:19:47,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-20 10:19:47,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-20 10:19:47,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-20 10:19:47,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,828 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:19:47,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2019-01-20 10:19:47,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:19:47,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-20 10:19:47,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:19:47,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-20 10:19:47,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-01-20 10:19:47,908 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:47,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:19:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:19:47,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:19:47,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-20 10:19:47,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:19:47,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:19:47,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:19:47,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:19:47,989 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-01-20 10:19:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:19:54,611 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-01-20 10:19:54,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:19:54,611 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-01-20 10:19:54,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:19:54,612 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:19:54,612 INFO L226 Difference]: Without dead ends: 0 [2019-01-20 10:19:54,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:19:54,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-20 10:19:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-20 10:19:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-20 10:19:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-20 10:19:54,613 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-20 10:19:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:19:54,613 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-20 10:19:54,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:19:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-20 10:19:54,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-20 10:19:54,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-20 10:19:54,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:19:54,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:19:54,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:19:54,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:20:00,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:20:06,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:20:08,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:20:09,082 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:20:09,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:20:12,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:20:32,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:20:43,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent.