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-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:22:50,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:22:50,222 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:22:50,239 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:22:50,240 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:22:50,241 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:22:50,243 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:22:50,245 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:22:50,247 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:22:50,248 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:22:50,251 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:22:50,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:22:50,252 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:22:50,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:22:50,260 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:22:50,261 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:22:50,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:22:50,267 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:22:50,272 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:22:50,273 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:22:50,275 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:22:50,277 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:22:50,282 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:22:50,282 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:22:50,282 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:22:50,284 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:22:50,285 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:22:50,286 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:22:50,286 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:22:50,287 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:22:50,288 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:22:50,288 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:22:50,288 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:22:50,289 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:22:50,290 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:22:50,291 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:22:50,291 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-25 15:22:50,313 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:22:50,313 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:22:50,314 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:22:50,314 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:22:50,315 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:22:50,315 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:22:50,315 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:22:50,315 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:22:50,315 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:22:50,316 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:22:50,316 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:22:50,316 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:22:50,316 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:22:50,316 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:22:50,320 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:22:50,320 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:22:50,320 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:22:50,321 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:22:50,321 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:22:50,321 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:22:50,321 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:22:50,321 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:22:50,321 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:22:50,323 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:22:50,323 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:22:50,323 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:22:50,323 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:22:50,323 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:22:50,324 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:22:50,325 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:22:50,325 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:22:50,325 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:22:50,325 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:22:50,326 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:22:50,326 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:22:50,326 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:22:50,326 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:22:50,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:22:50,327 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:22:50,327 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:22:50,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:22:50,379 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:22:50,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:22:50,389 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:22:50,390 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:22:50,390 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-02-25 15:22:50,391 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-02-25 15:22:50,434 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:22:50,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:22:50,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:22:50,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:22:50,436 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:22:50,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:50" (1/1) ... [2019-02-25 15:22:50,467 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:50" (1/1) ... [2019-02-25 15:22:50,499 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:22:50,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:22:50,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:22:50,501 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:22:50,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:50" (1/1) ... [2019-02-25 15:22:50,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:50" (1/1) ... [2019-02-25 15:22:50,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:50" (1/1) ... [2019-02-25 15:22:50,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:50" (1/1) ... [2019-02-25 15:22:50,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:50" (1/1) ... [2019-02-25 15:22:50,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:50" (1/1) ... [2019-02-25 15:22:50,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:50" (1/1) ... [2019-02-25 15:22:50,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:22:50,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:22:50,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:22:50,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:22:50,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:50" (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-02-25 15:22:50,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:22:50,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:22:51,002 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:22:51,003 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-02-25 15:22:51,004 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:22:51 BoogieIcfgContainer [2019-02-25 15:22:51,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:22:51,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:22:51,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:22:51,009 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:22:51,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:22:50" (1/2) ... [2019-02-25 15:22:51,010 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439b4be and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:22:51, skipping insertion in model container [2019-02-25 15:22:51,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:22:51" (2/2) ... [2019-02-25 15:22:51,012 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-02-25 15:22:51,023 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:22:51,031 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-02-25 15:22:51,051 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-02-25 15:22:51,090 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:22:51,090 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:22:51,090 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:22:51,091 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:22:51,091 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:22:51,091 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:22:51,091 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:22:51,092 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:22:51,105 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-02-25 15:22:51,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:22:51,111 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:51,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:22:51,115 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:51,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:51,121 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-02-25 15:22:51,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:51,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:51,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:51,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:51,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:51,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:22:51,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:22:51,306 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:22:51,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:22:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:22:51,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:22:51,327 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-02-25 15:22:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:51,502 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-02-25 15:22:51,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:22:51,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:22:51,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:51,517 INFO L225 Difference]: With dead ends: 29 [2019-02-25 15:22:51,518 INFO L226 Difference]: Without dead ends: 24 [2019-02-25 15:22:51,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:22:51,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-25 15:22:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-02-25 15:22:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-25 15:22:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-02-25 15:22:51,553 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-02-25 15:22:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:51,554 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-02-25 15:22:51,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:22:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-02-25 15:22:51,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:22:51,555 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:51,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:22:51,556 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:51,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:51,556 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-02-25 15:22:51,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:51,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:51,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:51,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:51,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:51,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:51,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:51,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:51,723 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:22:51,724 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-02-25 15:22:51,761 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:51,761 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:51,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:51,835 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:22:51,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:51,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:51,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:51,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:51,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:51,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:51,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:22:51,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:52,209 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:22:52,210 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:52,374 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:52,476 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:52,556 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:52,652 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:52,720 INFO L467 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 21 treesize of output 24 [2019-02-25 15:22:52,739 INFO L467 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 24 treesize of output 30 [2019-02-25 15:22:52,758 INFO L467 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 26 treesize of output 40 [2019-02-25 15:22:52,778 INFO L467 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 28 treesize of output 54 [2019-02-25 15:22:52,795 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:22:52,900 INFO L467 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 32 treesize of output 71 [2019-02-25 15:22:52,901 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:52,969 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:53,059 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:53,116 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:53,136 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:53,159 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:53,480 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:53,484 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:22:53,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:53,585 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:22:53,588 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:53,624 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:53,625 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-25 15:22:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:53,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:53,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:53,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:22:53,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:53,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:22:53,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:22:53,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:22:53,772 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-02-25 15:22:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:54,261 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-02-25 15:22:54,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:22:54,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:22:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:54,264 INFO L225 Difference]: With dead ends: 47 [2019-02-25 15:22:54,265 INFO L226 Difference]: Without dead ends: 45 [2019-02-25 15:22:54,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:22:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-25 15:22:54,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-02-25 15:22:54,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-25 15:22:54,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-02-25 15:22:54,272 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-02-25 15:22:54,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:54,272 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-02-25 15:22:54,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:22:54,273 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-02-25 15:22:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:22:54,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:54,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:22:54,274 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:54,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:54,274 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-02-25 15:22:54,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:54,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:54,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:54,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:54,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:54,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:54,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:54,357 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:22:54,357 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-02-25 15:22:54,360 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:54,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:54,372 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:54,372 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:22:54,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:54,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:54,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:54,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:54,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:54,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:54,390 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:22:54,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:54,398 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:22:54,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,406 INFO L467 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 24 treesize of output 30 [2019-02-25 15:22:54,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,416 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:22:54,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,442 INFO L467 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 28 treesize of output 54 [2019-02-25 15:22:54,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,460 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:22:54,493 INFO L467 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 32 treesize of output 71 [2019-02-25 15:22:54,495 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,544 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,581 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,622 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,642 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,692 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,767 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:22:54,768 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,803 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,813 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,827 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,847 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,887 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:54,887 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-02-25 15:22:54,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:54,934 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:22:54,935 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:54,988 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:54,988 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-25 15:22:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:55,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:55,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:22:55,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:22:55,057 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:22:55,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:22:55,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:22:55,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:22:55,059 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-02-25 15:22:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:55,119 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-02-25 15:22:55,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:22:55,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:22:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:55,121 INFO L225 Difference]: With dead ends: 23 [2019-02-25 15:22:55,121 INFO L226 Difference]: Without dead ends: 22 [2019-02-25 15:22:55,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:22:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-25 15:22:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-25 15:22:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:22:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-02-25 15:22:55,129 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-02-25 15:22:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:55,130 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-02-25 15:22:55,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:22:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-02-25 15:22:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:22:55,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:55,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:22:55,131 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:55,132 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-02-25 15:22:55,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:55,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:55,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:55,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:55,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:55,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:55,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:55,231 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:22:55,232 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-02-25 15:22:55,234 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:55,234 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:55,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:55,241 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:22:55,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:55,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:55,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:55,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:55,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:55,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:55,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:22:55,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:55,414 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:22:55,417 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,540 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,600 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,616 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,649 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,690 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,730 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:22:55,733 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:22:55,739 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:22:55,745 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:22:55,767 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:22:55,787 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:22:55,788 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,847 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,868 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,892 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,906 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,918 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:55,966 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:55,966 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-02-25 15:22:56,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:56,037 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:22:56,038 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:56,090 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:56,091 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:22:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:56,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:56,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:56,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:56,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:22:56,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:56,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:22:56,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:22:56,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:22:56,155 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-02-25 15:22:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:56,336 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-02-25 15:22:56,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:22:56,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:22:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:56,338 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:22:56,338 INFO L226 Difference]: Without dead ends: 36 [2019-02-25 15:22:56,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:22:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-25 15:22:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-02-25 15:22:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:22:56,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-02-25 15:22:56,345 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-02-25 15:22:56,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:56,345 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-02-25 15:22:56,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:22:56,345 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-02-25 15:22:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:22:56,346 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:56,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:22:56,346 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:56,347 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-02-25 15:22:56,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:56,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:56,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:56,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:56,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:56,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:56,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:56,401 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:22:56,401 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-02-25 15:22:56,404 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:56,404 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:56,409 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:56,410 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:22:56,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:56,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:56,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:56,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:56,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:56,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:56,428 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:22:56,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:56,439 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:22:56,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:56,445 INFO L467 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 24 treesize of output 30 [2019-02-25 15:22:56,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:56,455 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:56,456 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:22:56,462 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:56,463 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:56,465 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:56,466 INFO L467 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 28 treesize of output 54 [2019-02-25 15:22:56,473 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:56,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:56,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:56,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:56,480 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:22:56,510 INFO L467 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 32 treesize of output 71 [2019-02-25 15:22:56,511 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:56,540 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:56,563 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:56,580 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:56,596 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:56,624 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:56,856 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:22:56,856 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:57,011 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:57,123 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:57,172 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:57,189 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:57,224 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:57,224 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:22:57,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:57,339 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:22:57,340 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:57,379 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:57,380 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-25 15:22:57,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:57,408 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:57,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:57,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:57,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:22:57,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:57,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:22:57,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:22:57,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:22:57,441 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-02-25 15:22:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:57,671 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-02-25 15:22:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:22:57,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:22:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:57,674 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:22:57,674 INFO L226 Difference]: Without dead ends: 47 [2019-02-25 15:22:57,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:22:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-25 15:22:57,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-02-25 15:22:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:22:57,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-02-25 15:22:57,682 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-02-25 15:22:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:57,682 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-02-25 15:22:57,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:22:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-02-25 15:22:57,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:22:57,683 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:57,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:22:57,684 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:57,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:57,684 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-02-25 15:22:57,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:57,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:57,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:57,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:57,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:57,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:57,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:57,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:57,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:22:57,741 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-02-25 15:22:57,743 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:57,743 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:57,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:57,751 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:22:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:57,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:57,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:57,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:57,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:57,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:57,773 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:22:57,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:57,793 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:22:57,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:57,809 INFO L467 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 24 treesize of output 30 [2019-02-25 15:22:57,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:57,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:57,819 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:22:57,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:57,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:57,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:57,836 INFO L467 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 28 treesize of output 54 [2019-02-25 15:22:57,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:57,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:57,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:57,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:57,847 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:22:57,860 INFO L467 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 32 treesize of output 71 [2019-02-25 15:22:57,861 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:57,919 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:57,953 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:57,975 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:57,993 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:58,008 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:58,082 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:22:58,083 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:58,103 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:58,115 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:58,127 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:58,151 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:58,195 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:58,196 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:22:58,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:58,251 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:22:58,252 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:58,280 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:58,281 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:22:58,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:58,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:58,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:58,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:58,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:58,312 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:58,314 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:22:58,315 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:58,342 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:58,343 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:22:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:58,398 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:58,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:58,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:22:58,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:58,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:22:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:22:58,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:22:58,445 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-02-25 15:22:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:58,920 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-02-25 15:22:58,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:22:58,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:22:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:58,922 INFO L225 Difference]: With dead ends: 61 [2019-02-25 15:22:58,922 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:22:58,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:22:58,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:22:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-25 15:22:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:22:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-02-25 15:22:58,932 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-02-25 15:22:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:58,932 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-02-25 15:22:58,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:22:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-02-25 15:22:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:22:58,933 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:58,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:22:58,933 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-02-25 15:22:58,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:58,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:58,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:58,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:58,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:59,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:59,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:59,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:59,024 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:22:59,024 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-02-25 15:22:59,025 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:22:59,025 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:22:59,031 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:22:59,031 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:22:59,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:59,032 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:22:59,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:59,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:59,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:59,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:59,048 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:22:59,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:59,115 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:22:59,116 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,139 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,151 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,172 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,200 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,229 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,266 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:22:59,292 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:22:59,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:22:59,317 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:22:59,320 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:22:59,326 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:22:59,327 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,359 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,380 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,396 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,409 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,420 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,466 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:59,466 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:22:59,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:59,493 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:22:59,494 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,648 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:59,649 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:22:59,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:59,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:59,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:59,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:59,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:22:59,685 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:22:59,687 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:22:59,688 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:59,732 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:22:59,732 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:22:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:59,755 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:59,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:59,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:22:59,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:59,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:22:59,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:22:59,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:22:59,806 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-02-25 15:23:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:00,305 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-02-25 15:23:00,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:00,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:00,307 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:23:00,307 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:23:00,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:00,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:23:00,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-02-25 15:23:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-25 15:23:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-02-25 15:23:00,320 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-02-25 15:23:00,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:00,321 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-02-25 15:23:00,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-02-25 15:23:00,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:00,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:00,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:00,322 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:00,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:00,322 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-02-25 15:23:00,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:00,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:00,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:00,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:00,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:00,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:00,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:00,407 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:00,408 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-02-25 15:23:00,409 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:00,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:00,414 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:00,415 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:00,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:00,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:00,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:00,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:00,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:00,434 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:23:00,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:00,440 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:00,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,448 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:00,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,463 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,464 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:00,474 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,479 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:00,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,490 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,493 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,496 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:00,539 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:00,540 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,580 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,600 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,617 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,631 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,644 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,689 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:00,690 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,700 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,709 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,740 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,758 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,791 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:00,791 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:00,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,851 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:00,851 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,880 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:00,881 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:00,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:00,965 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:00,966 INFO L467 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 68 [2019-02-25 15:23:00,966 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:00,997 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:00,997 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-02-25 15:23:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:01,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:01,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:01,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:01,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:01,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:01,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:01,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:01,059 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-02-25 15:23:01,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:01,459 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-02-25 15:23:01,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:01,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:01,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:01,461 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:23:01,461 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:23:01,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:23:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-02-25 15:23:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-25 15:23:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-02-25 15:23:01,471 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-02-25 15:23:01,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:01,472 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-02-25 15:23:01,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-02-25 15:23:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:01,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:01,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:01,473 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:01,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:01,473 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-02-25 15:23:01,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:01,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:01,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:01,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:01,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:01,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:01,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:01,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:01,630 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-02-25 15:23:01,632 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:01,632 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:01,637 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:01,637 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:01,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:01,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:01,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:01,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:01,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:01,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:01,657 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:23:01,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:01,702 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:01,702 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,712 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,720 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,732 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,751 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,772 INFO L467 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 21 treesize of output 24 [2019-02-25 15:23:01,776 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:01,779 INFO L467 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 26 treesize of output 40 [2019-02-25 15:23:01,785 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:01,788 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:01,804 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:01,805 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,843 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,867 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,882 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,895 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,907 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:01,940 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:01,941 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:02,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,032 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:02,033 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:02,388 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:02,388 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:02,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,546 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,548 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:02,551 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:23:02,551 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:02,581 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:02,582 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:23:02,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:02,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:02,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:02,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:02,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:02,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:02,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:02,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:02,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:02,651 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-02-25 15:23:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:03,091 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-02-25 15:23:03,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:03,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:03,092 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:23:03,093 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:23:03,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:03,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:23:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-02-25 15:23:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:23:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-02-25 15:23:03,103 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-02-25 15:23:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:03,103 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-02-25 15:23:03,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-02-25 15:23:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:03,104 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:03,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:03,104 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:03,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:03,104 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-02-25 15:23:03,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:03,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:03,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:03,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:03,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:03,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:03,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:03,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:03,229 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:03,230 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-02-25 15:23:03,233 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:03,233 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:03,237 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:03,237 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:03,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:03,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:03,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:03,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:03,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:03,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:03,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:23:03,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:03,289 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:03,290 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,306 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,317 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,332 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,352 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,376 INFO L467 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 21 treesize of output 24 [2019-02-25 15:23:03,379 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:03,384 INFO L467 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 26 treesize of output 40 [2019-02-25 15:23:03,387 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:03,390 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:03,402 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:03,403 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,437 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,458 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,474 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,486 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,497 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,530 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:03,531 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:03,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:03,570 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:03,571 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,598 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:03,599 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:03,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:03,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:03,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:03,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:03,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:03,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:03,637 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:23:03,638 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:03,667 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:03,667 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-25 15:23:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:03,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:03,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:03,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:03,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:23:03,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:03,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:03,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:03,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:23:03,735 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-02-25 15:23:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:04,071 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-02-25 15:23:04,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:23:04,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:04,072 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:23:04,072 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:23:04,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:23:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:23:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-02-25 15:23:04,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-25 15:23:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-02-25 15:23:04,083 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-02-25 15:23:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:04,083 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-02-25 15:23:04,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-02-25 15:23:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:04,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:04,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:04,084 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:04,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-02-25 15:23:04,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:04,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:04,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:04,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:04,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:04,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:04,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:04,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:04,239 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-02-25 15:23:04,240 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:04,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:04,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:04,248 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:23:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:04,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:04,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:04,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:04,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:04,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:04,264 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:23:04,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:04,269 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:04,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,307 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:04,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,316 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:04,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,326 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:04,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,374 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:04,381 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:04,382 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,411 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,434 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,455 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,471 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,486 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,536 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:04,536 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,546 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,553 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,564 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,584 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,622 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:04,622 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:04,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:04,674 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:04,675 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,704 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:04,704 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:04,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:04,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:04,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:04,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:04,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:04,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:04,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:04,749 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-02-25 15:23:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:04,953 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-02-25 15:23:04,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:04,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:23:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:04,956 INFO L225 Difference]: With dead ends: 56 [2019-02-25 15:23:04,956 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:23:04,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:23:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:23:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-02-25 15:23:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-25 15:23:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-02-25 15:23:04,967 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-02-25 15:23:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:04,967 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-02-25 15:23:04,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:04,967 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-02-25 15:23:04,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:04,968 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:04,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:04,968 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:04,969 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-02-25 15:23:04,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:04,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:04,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:04,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:04,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:05,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:05,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:05,103 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:05,104 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-02-25 15:23:05,105 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:05,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:05,109 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:05,110 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:05,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:05,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:05,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:05,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:05,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:05,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:05,126 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:23:05,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:05,176 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:05,177 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,193 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,207 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,231 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,257 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,291 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,333 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:23:05,336 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:23:05,341 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:05,351 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:23:05,354 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:05,358 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:23:05,359 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,392 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,413 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,429 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,443 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,455 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,499 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:05,500 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:23:05,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,545 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:05,545 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,587 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:05,588 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:05,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,634 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:05,635 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,708 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:05,709 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:23:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:05,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:05,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:05,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:23:05,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:05,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:23:05,781 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-02-25 15:23:06,069 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-02-25 15:23:06,897 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2019-02-25 15:23:07,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:07,177 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-02-25 15:23:07,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:23:07,177 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:07,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:07,178 INFO L225 Difference]: With dead ends: 96 [2019-02-25 15:23:07,178 INFO L226 Difference]: Without dead ends: 93 [2019-02-25 15:23:07,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:23:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-25 15:23:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-02-25 15:23:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:23:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-02-25 15:23:07,192 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-02-25 15:23:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:07,192 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-02-25 15:23:07,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-02-25 15:23:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:07,193 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:07,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:07,193 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:07,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:07,193 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-02-25 15:23:07,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:07,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:07,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:07,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:07,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:07,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:07,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:07,274 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-02-25 15:23:07,275 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:07,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:07,280 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:07,280 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:07,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:07,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:07,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:07,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:07,292 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:07,297 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:23:07,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:07,301 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:07,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,305 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:07,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,311 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:07,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,317 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:07,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,395 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:07,419 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:07,420 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,455 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,478 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,496 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,510 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,523 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,576 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:07,576 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,586 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,595 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,609 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,626 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,659 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:07,659 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:07,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,716 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:07,716 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,743 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:07,743 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:07,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,776 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:23:07,776 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,803 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:07,803 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-25 15:23:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:07,826 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:07,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:07,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:07,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:07,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:07,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:07,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:07,871 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-02-25 15:23:08,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:08,432 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-02-25 15:23:08,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:08,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:08,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:08,434 INFO L225 Difference]: With dead ends: 84 [2019-02-25 15:23:08,434 INFO L226 Difference]: Without dead ends: 82 [2019-02-25 15:23:08,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:08,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-25 15:23:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-02-25 15:23:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-25 15:23:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-02-25 15:23:08,448 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-02-25 15:23:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:08,448 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-02-25 15:23:08,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-02-25 15:23:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:08,449 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:08,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:08,449 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:08,450 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-02-25 15:23:08,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:08,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:08,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:08,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:08,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:08,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:08,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:08,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:08,543 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-02-25 15:23:08,545 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:08,545 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:08,549 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:08,549 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:08,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:08,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:08,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:08,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:08,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:08,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:08,565 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:23:08,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:08,571 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:08,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,575 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:08,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,583 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:08,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,590 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:08,600 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,643 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:08,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,652 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:23:08,653 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,691 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,714 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,732 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,746 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,760 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,817 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:08,818 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,834 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,845 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,859 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,880 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,907 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,952 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:08,953 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:23:09,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,086 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:09,087 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:09,175 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:09,176 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:09,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,203 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,205 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,207 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:09,208 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:09,208 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:09,309 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:09,310 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:23:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:09,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:09,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:09,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:09,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:09,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:09,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:09,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:09,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:09,379 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-02-25 15:23:10,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:10,151 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-02-25 15:23:10,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:10,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:10,153 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:23:10,153 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:23:10,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:23:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-02-25 15:23:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:23:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-02-25 15:23:10,176 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-02-25 15:23:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:10,177 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-02-25 15:23:10,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:10,177 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-02-25 15:23:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:10,178 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:10,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:10,178 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:10,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:10,178 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-02-25 15:23:10,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:10,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:10,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:10,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-02-25 15:23:10,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:10,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:10,322 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:10,322 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-02-25 15:23:10,324 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:10,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:10,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:10,328 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:23:10,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:10,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:10,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:10,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:10,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:10,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:10,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:23:10,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:10,383 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:10,428 INFO L467 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 24 treesize of output 26 [2019-02-25 15:23:10,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:10,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:10,500 INFO L467 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 26 treesize of output 36 [2019-02-25 15:23:10,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:10,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:10,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:10,599 INFO L467 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 28 treesize of output 50 [2019-02-25 15:23:10,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:10,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:10,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:10,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:10,643 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:23:10,651 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:23:10,651 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,677 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,705 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,721 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,734 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,746 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,784 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:23:10,785 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,806 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,817 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,832 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,861 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:10,862 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-02-25 15:23:12,913 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-02-25 15:23:12,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,953 INFO L467 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 66 [2019-02-25 15:23:12,954 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:23:13,097 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:23:13,098 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-02-25 15:23:15,380 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2019-02-25 15:23:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:15,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:15,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:15,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:23:15,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:23:15,448 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:15,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:23:15,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:23:15,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:23:15,449 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-02-25 15:23:15,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:15,696 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-02-25 15:23:15,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:23:15,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:23:15,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:15,698 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:23:15,698 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:23:15,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:23:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:23:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-02-25 15:23:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-25 15:23:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-02-25 15:23:15,729 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-02-25 15:23:15,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:15,733 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-02-25 15:23:15,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:23:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-02-25 15:23:15,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:15,734 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:15,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:15,735 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:15,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:15,735 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-02-25 15:23:15,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:15,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:15,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:15,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:15,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:15,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:15,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:15,851 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:15,852 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-02-25 15:23:15,852 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:15,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:15,856 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:15,856 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:15,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:15,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:15,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:15,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:15,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:15,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:23:15,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:15,915 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:15,916 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,928 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,940 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,955 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,981 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,030 INFO L467 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 21 treesize of output 24 [2019-02-25 15:23:16,032 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:16,050 INFO L467 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 26 treesize of output 40 [2019-02-25 15:23:16,057 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:16,059 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:16,080 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:16,080 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,107 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,126 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,142 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,155 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,167 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,199 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:16,200 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:16,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,238 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:16,238 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,265 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:16,265 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:16,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,292 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:23:16,293 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,320 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:16,320 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:23:16,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:16,338 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:16,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:16,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:16,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:16,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:16,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:16,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:16,379 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-02-25 15:23:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:16,784 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-02-25 15:23:16,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:16,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:16,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:16,787 INFO L225 Difference]: With dead ends: 121 [2019-02-25 15:23:16,787 INFO L226 Difference]: Without dead ends: 119 [2019-02-25 15:23:16,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:16,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-25 15:23:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-02-25 15:23:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:23:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-02-25 15:23:16,802 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-02-25 15:23:16,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:16,803 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-02-25 15:23:16,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-02-25 15:23:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:16,804 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:16,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:16,812 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:16,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:16,813 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-02-25 15:23:16,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:16,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:16,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:16,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:16,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:16,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:16,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:16,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:16,858 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-02-25 15:23:16,859 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:16,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:16,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:16,862 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:23:16,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:16,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:16,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:16,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:16,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:16,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:16,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:16,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:23:16,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:16,886 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:16,896 INFO L467 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 24 treesize of output 26 [2019-02-25 15:23:16,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,904 INFO L467 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 26 treesize of output 36 [2019-02-25 15:23:16,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,924 INFO L467 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 28 treesize of output 50 [2019-02-25 15:23:16,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,956 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:23:16,965 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:23:16,966 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,991 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,012 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,026 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,039 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,052 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,088 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:23:17,088 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,096 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,107 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,121 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,152 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:17,153 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-25 15:23:17,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,208 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:23:17,208 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,234 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:17,234 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-25 15:23:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:17,250 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:17,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:17,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:17,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:17,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:17,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:17,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:17,281 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-02-25 15:23:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:17,516 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-02-25 15:23:17,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:17,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:23:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:17,519 INFO L225 Difference]: With dead ends: 110 [2019-02-25 15:23:17,520 INFO L226 Difference]: Without dead ends: 109 [2019-02-25 15:23:17,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:23:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-25 15:23:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-02-25 15:23:17,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:23:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-02-25 15:23:17,542 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-02-25 15:23:17,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:17,543 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-02-25 15:23:17,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-02-25 15:23:17,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:17,544 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:17,544 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-25 15:23:17,544 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:17,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-02-25 15:23:17,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:17,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:17,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:17,546 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:17,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:17,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:17,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:17,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:23:17,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:23:17,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:17,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:17,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:23:17,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:23:17,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:23:17,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:23:17,738 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:23:17,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:17,757 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:17,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,781 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:17,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,789 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:17,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,797 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:17,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,806 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:17,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,829 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:23:17,830 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,872 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,893 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,912 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,927 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,941 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,005 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:18,006 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,021 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,032 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,046 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,069 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,097 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,143 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:18,143 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-02-25 15:23:18,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,198 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:18,199 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,279 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:18,280 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:18,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,299 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,307 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 91 [2019-02-25 15:23:18,307 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,362 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:18,363 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-02-25 15:23:18,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,408 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:18,408 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,458 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:18,458 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:23:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:18,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:18,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:18,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:23:18,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:18,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:18,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:18,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:18,570 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-02-25 15:23:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:19,213 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-02-25 15:23:19,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:23:19,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:19,216 INFO L225 Difference]: With dead ends: 133 [2019-02-25 15:23:19,216 INFO L226 Difference]: Without dead ends: 128 [2019-02-25 15:23:19,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-02-25 15:23:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-02-25 15:23:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-25 15:23:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-02-25 15:23:19,230 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-02-25 15:23:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:19,230 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-02-25 15:23:19,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-02-25 15:23:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:19,231 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:19,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:19,231 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:19,232 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-02-25 15:23:19,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:19,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:19,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:23:19,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:19,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:19,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:19,314 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:19,314 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:19,315 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-02-25 15:23:19,315 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:19,316 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:19,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:19,319 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:19,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:19,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:19,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:19,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:19,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:19,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:19,338 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:23:19,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:19,358 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:19,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,370 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:19,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,376 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:19,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,387 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:19,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,398 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:19,406 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:19,407 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,435 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,456 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,474 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,488 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,501 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,557 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:19,558 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,581 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,593 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,608 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,625 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,657 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:19,657 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:19,727 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,728 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:19,728 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,794 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:19,795 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:19,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,819 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,820 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,825 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:23:19,825 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,849 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:19,850 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:23:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:19,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:19,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:19,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:19,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:19,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:19,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:19,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:19,910 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-02-25 15:23:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:20,244 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-02-25 15:23:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:20,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:23:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:20,246 INFO L225 Difference]: With dead ends: 125 [2019-02-25 15:23:20,247 INFO L226 Difference]: Without dead ends: 124 [2019-02-25 15:23:20,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:20,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-25 15:23:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-02-25 15:23:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-25 15:23:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-02-25 15:23:20,265 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-02-25 15:23:20,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:20,266 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-02-25 15:23:20,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-02-25 15:23:20,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:20,267 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:20,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:20,267 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:20,267 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-02-25 15:23:20,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:20,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:20,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:20,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:20,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:20,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:20,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:20,409 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:20,409 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-02-25 15:23:20,410 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:20,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:20,413 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:20,414 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:23:20,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:20,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:20,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:20,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:20,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:20,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:20,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:23:20,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:20,471 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:20,471 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,486 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,496 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,513 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,531 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,561 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,596 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:23:20,598 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:23:20,600 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:20,603 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:23:20,607 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:20,610 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:23:20,610 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,647 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,667 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,683 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,696 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,707 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:20,751 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:20,751 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:23:20,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:20,826 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:20,827 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:21,066 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:21,066 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:21,144 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,150 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:21,151 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:21,189 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:21,189 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:23:21,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,220 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:21,224 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:21,225 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:21,234 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:21,271 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:21,272 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:23:21,294 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:21,294 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:21,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:21,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:21,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:23:21,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:21,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:21,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:21,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:21,383 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-02-25 15:23:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:23,644 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-02-25 15:23:23,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:23:23,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:23,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:23,646 INFO L225 Difference]: With dead ends: 149 [2019-02-25 15:23:23,646 INFO L226 Difference]: Without dead ends: 145 [2019-02-25 15:23:23,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:23:23,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-25 15:23:23,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-02-25 15:23:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:23:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-02-25 15:23:23,668 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-02-25 15:23:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:23,668 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-02-25 15:23:23,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-02-25 15:23:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:23,669 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:23,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:23,669 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:23,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-02-25 15:23:23,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:23,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:23,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:23,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:23,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:23,829 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:23:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:23,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:23,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:23,899 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:23,899 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-02-25 15:23:23,900 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:23,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:23,903 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:23,903 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:23:23,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:23,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:23,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:23,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:23,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:23,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:23,925 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:23,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:23,930 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:23,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:23,934 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:23,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:23,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:23,943 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:23,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:23,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:23,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:23,957 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:23,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:23,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:23,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:23,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:23,966 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:23,974 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:23,975 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,001 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,022 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,040 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,053 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,067 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,111 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:24,112 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,122 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,131 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,141 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,159 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,191 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:24,192 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:24,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,248 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:24,248 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,276 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:24,277 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:24,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:23:24,310 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,338 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:24,338 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-25 15:23:24,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:24,367 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:24,368 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:23:24,369 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:24,394 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:24,394 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:23:24,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:24,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:24,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:24,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:23:24,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:24,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:24,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:24,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:24,473 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-02-25 15:23:24,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:24,993 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-02-25 15:23:24,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:23:24,993 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:24,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:24,996 INFO L225 Difference]: With dead ends: 138 [2019-02-25 15:23:24,996 INFO L226 Difference]: Without dead ends: 136 [2019-02-25 15:23:24,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:23:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-25 15:23:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-02-25 15:23:25,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-25 15:23:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-02-25 15:23:25,018 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-02-25 15:23:25,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:25,019 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-02-25 15:23:25,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:25,019 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-02-25 15:23:25,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:25,020 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:25,020 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:25,020 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:25,021 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-02-25 15:23:25,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:25,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:25,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:25,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:25,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:25,384 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-02-25 15:23:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:25,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:25,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:25,711 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:25,712 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-02-25 15:23:25,713 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:25,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:25,716 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:25,716 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:23:25,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:25,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:25,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:25,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:25,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:25,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:25,755 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:23:25,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:25,814 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:25,815 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,830 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,842 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,860 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,879 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,912 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:25,983 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:23:25,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:23:25,991 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:25,994 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:23:25,997 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:26,015 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:23:26,015 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:26,203 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:26,221 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:26,238 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:26,250 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:26,260 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:26,307 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:26,308 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:23:26,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,337 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:26,337 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:26,380 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:26,380 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:26,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,411 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:26,412 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:26,413 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:26,454 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:26,455 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:23:26,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,482 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,484 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:26,486 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:23:26,487 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:26,531 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:26,531 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-25 15:23:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:26,550 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:26,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:26,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:23:26,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:26,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:26,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:26,598 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-02-25 15:23:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:27,203 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-02-25 15:23:27,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:23:27,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:27,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:27,207 INFO L225 Difference]: With dead ends: 152 [2019-02-25 15:23:27,208 INFO L226 Difference]: Without dead ends: 151 [2019-02-25 15:23:27,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:23:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-25 15:23:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-02-25 15:23:27,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-25 15:23:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-02-25 15:23:27,229 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-02-25 15:23:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:27,229 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-02-25 15:23:27,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-02-25 15:23:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:27,230 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:27,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:27,231 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-02-25 15:23:27,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:27,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:27,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:27,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:27,529 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-02-25 15:23:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:27,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:27,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:27,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:27,573 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-02-25 15:23:27,574 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:27,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:27,577 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:27,577 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:23:27,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:27,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:27,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:27,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:27,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:27,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:27,606 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:23:27,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:27,664 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:27,664 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:27,683 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:27,769 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:27,783 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:27,806 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:27,841 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:27,883 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:23:27,886 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:23:27,890 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:27,893 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:23:27,897 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:27,903 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:23:27,904 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:27,938 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:27,957 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:27,973 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:27,987 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:28,000 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:28,047 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:28,048 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:23:28,083 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,083 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:28,084 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:28,129 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:28,129 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:28,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,160 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:28,162 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:28,162 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:28,212 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:28,213 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:61 [2019-02-25 15:23:28,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,243 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:28,248 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:28,249 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:23:28,249 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:28,292 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:28,293 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:59 [2019-02-25 15:23:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:28,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:28,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:28,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:23:28,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:28,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:28,383 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-02-25 15:23:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:31,168 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-02-25 15:23:31,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:23:31,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:31,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:31,171 INFO L225 Difference]: With dead ends: 141 [2019-02-25 15:23:31,171 INFO L226 Difference]: Without dead ends: 140 [2019-02-25 15:23:31,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:23:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-02-25 15:23:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-02-25 15:23:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-25 15:23:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-02-25 15:23:31,193 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-02-25 15:23:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:31,193 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-02-25 15:23:31,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-02-25 15:23:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:31,194 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:31,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:31,194 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:31,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:31,195 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-02-25 15:23:31,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:31,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:31,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:31,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:31,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:31,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:31,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:31,263 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-02-25 15:23:31,265 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:31,265 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:31,269 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:31,269 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:23:31,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:31,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:31,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:31,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:31,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:31,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:31,284 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:31,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:31,293 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:31,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,297 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:31,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,302 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:31,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,312 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,313 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:31,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,321 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:31,448 INFO L292 Elim1Store]: Index analysis took 124 ms [2019-02-25 15:23:31,449 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:31,449 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,531 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,553 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,570 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,584 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,598 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,642 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:31,642 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,653 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,661 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,677 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,694 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,727 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:31,728 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:31,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,765 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:31,765 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,803 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:31,803 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:31,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,829 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:31,830 INFO L467 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 68 [2019-02-25 15:23:31,830 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,884 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:31,884 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-02-25 15:23:31,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,908 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,913 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 70 [2019-02-25 15:23:31,914 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,942 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:31,942 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-25 15:23:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:31,958 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:32,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:32,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:23:32,002 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:32,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:32,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:32,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:32,003 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-02-25 15:23:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:32,678 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-02-25 15:23:32,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:23:32,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:32,681 INFO L225 Difference]: With dead ends: 163 [2019-02-25 15:23:32,681 INFO L226 Difference]: Without dead ends: 162 [2019-02-25 15:23:32,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:23:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-02-25 15:23:32,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-02-25 15:23:32,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-25 15:23:32,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-02-25 15:23:32,706 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-02-25 15:23:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:32,706 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-02-25 15:23:32,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-02-25 15:23:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:32,707 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:32,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:32,707 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:32,708 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-02-25 15:23:32,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:32,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:32,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:32,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:32,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:32,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:32,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:32,843 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:32,844 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-02-25 15:23:32,845 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:32,845 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:32,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:32,847 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:23:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:32,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:32,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:32,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:32,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:32,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:32,866 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:23:32,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:32,950 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:32,951 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,972 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,987 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,004 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,039 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,082 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,116 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:23:33,120 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:23:33,123 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:33,127 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:23:33,130 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:33,133 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:23:33,134 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,169 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,189 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,205 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,218 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,229 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,276 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:33,276 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:23:33,313 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,314 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:33,314 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,359 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:33,360 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:33,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,399 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:33,400 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,444 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:33,444 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:23:33,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,472 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,472 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,473 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,474 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,480 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:33,481 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:33,481 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,521 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:33,522 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:23:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:33,546 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:33,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:33,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:23:33,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:33,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:33,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:33,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:33,602 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-02-25 15:23:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:34,343 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-02-25 15:23:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:23:34,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:34,346 INFO L225 Difference]: With dead ends: 163 [2019-02-25 15:23:34,347 INFO L226 Difference]: Without dead ends: 160 [2019-02-25 15:23:34,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:23:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-25 15:23:34,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-02-25 15:23:34,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-25 15:23:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-02-25 15:23:34,369 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-02-25 15:23:34,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:34,369 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-02-25 15:23:34,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:34,369 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-02-25 15:23:34,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:34,370 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:34,370 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:34,370 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:34,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:34,370 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-02-25 15:23:34,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:34,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:34,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:34,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:34,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:34,493 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:34,493 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-02-25 15:23:34,495 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:34,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:34,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:34,497 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:23:34,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:34,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:34,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:34,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:34,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:34,508 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:34,527 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:34,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:34,627 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:34,628 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,639 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,652 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,669 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,688 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,713 INFO L467 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 21 treesize of output 24 [2019-02-25 15:23:34,716 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:34,719 INFO L467 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 26 treesize of output 40 [2019-02-25 15:23:34,721 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:34,724 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:34,732 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:34,733 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,758 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,777 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,793 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,806 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,819 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,853 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:34,854 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:34,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,907 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:34,908 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,933 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:34,934 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:34,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,965 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:23:34,966 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,993 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:34,993 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-25 15:23:35,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,028 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:35,029 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:23:35,029 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:35,056 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:35,056 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:23:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:35,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:35,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:35,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:23:35,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:35,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:35,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:35,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:35,140 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-02-25 15:23:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:35,694 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-02-25 15:23:35,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:23:35,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:35,697 INFO L225 Difference]: With dead ends: 165 [2019-02-25 15:23:35,697 INFO L226 Difference]: Without dead ends: 163 [2019-02-25 15:23:35,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:23:35,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-25 15:23:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-02-25 15:23:35,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-25 15:23:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-02-25 15:23:35,720 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-02-25 15:23:35,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:35,720 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-02-25 15:23:35,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:35,721 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-02-25 15:23:35,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:35,721 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:35,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:35,722 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:35,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:35,722 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-02-25 15:23:35,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:35,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:35,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:35,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:23:35,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:35,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:35,770 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:35,770 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-02-25 15:23:35,770 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:35,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:35,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:35,773 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:35,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:35,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:35,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:35,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:35,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:35,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:35,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:23:35,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:35,794 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:35,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,797 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:35,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,803 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:35,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,814 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,814 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:35,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:35,825 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:35,868 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:35,868 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:35,895 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:35,915 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:35,932 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:35,947 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:35,960 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,003 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:36,004 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,015 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,026 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,042 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,060 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,093 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:36,094 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:36,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,134 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:36,134 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,163 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:36,164 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:36,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,186 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:36,187 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:36,187 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,216 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:36,216 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-25 15:23:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:36,234 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:36,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:36,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-25 15:23:36,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:36,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:23:36,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:23:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:23:36,270 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-02-25 15:23:36,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:36,566 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-02-25 15:23:36,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:36,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-25 15:23:36,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:36,569 INFO L225 Difference]: With dead ends: 158 [2019-02-25 15:23:36,569 INFO L226 Difference]: Without dead ends: 156 [2019-02-25 15:23:36,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:23:36,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-02-25 15:23:36,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-02-25 15:23:36,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-02-25 15:23:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-02-25 15:23:36,589 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-02-25 15:23:36,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:36,590 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-02-25 15:23:36,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:23:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-02-25 15:23:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:36,590 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:36,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:36,591 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:36,591 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-02-25 15:23:36,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:36,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:36,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:36,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:36,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:36,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-02-25 15:23:36,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:36,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:36,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:23:36,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:23:36,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:36,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:36,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:23:36,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:23:36,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:23:36,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:23:36,716 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:23:36,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:36,774 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:36,775 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,790 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,800 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,813 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,835 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,865 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,900 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:23:36,904 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:23:36,908 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:36,930 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:23:36,934 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:36,941 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:23:36,942 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,977 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,998 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,015 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,029 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,041 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,086 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:37,087 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:23:37,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,117 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:37,118 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,162 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:37,162 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:37,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,212 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,216 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:37,216 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,264 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:37,265 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:23:37,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,312 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:37,313 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:37,314 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,355 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:37,355 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:23:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:37,376 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:37,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:37,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:37,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-25 15:23:37,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:37,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:37,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:37,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:23:37,416 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-02-25 15:23:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:38,120 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-02-25 15:23:38,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:23:38,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:38,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:38,123 INFO L225 Difference]: With dead ends: 241 [2019-02-25 15:23:38,123 INFO L226 Difference]: Without dead ends: 235 [2019-02-25 15:23:38,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:23:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-02-25 15:23:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-02-25 15:23:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-25 15:23:38,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-02-25 15:23:38,159 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-02-25 15:23:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:38,159 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-02-25 15:23:38,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-02-25 15:23:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:38,160 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:38,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:38,160 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:38,161 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-02-25 15:23:38,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:38,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:38,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:23:38,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:38,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:23:38,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:38,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:38,516 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:38,516 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-02-25 15:23:38,517 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:38,517 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:38,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:38,519 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:38,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:38,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:38,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:38,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:38,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:38,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:38,548 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:23:38,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:38,570 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:38,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:38,609 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:38,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:38,658 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:38,658 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:38,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:38,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:38,668 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:38,669 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:38,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:38,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:38,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:38,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:38,676 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:38,685 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:38,686 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,712 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,752 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,769 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,783 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,798 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,843 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:38,843 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,854 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,865 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,887 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,906 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,940 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:38,940 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:39,174 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-25 15:23:39,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,195 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 15:23:39,196 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:23:39,304 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:23:39,304 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-02-25 15:23:39,553 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-02-25 15:23:39,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,618 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,641 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,673 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:39,673 INFO L292 Elim1Store]: Index analysis took 115 ms [2019-02-25 15:23:39,674 INFO L467 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 60 treesize of output 66 [2019-02-25 15:23:39,674 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:39,821 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 95 [2019-02-25 15:23:39,826 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-02-25 15:23:40,112 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-25 15:23:40,112 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-02-25 15:23:40,274 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-02-25 15:23:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:40,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:40,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:40,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:40,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:40,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:40,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:40,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:40,421 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-02-25 15:23:40,919 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-02-25 15:23:41,426 WARN L181 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-02-25 15:23:41,944 WARN L181 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-02-25 15:23:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:42,392 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-02-25 15:23:42,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:23:42,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:23:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:42,395 INFO L225 Difference]: With dead ends: 208 [2019-02-25 15:23:42,396 INFO L226 Difference]: Without dead ends: 207 [2019-02-25 15:23:42,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-25 15:23:42,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-02-25 15:23:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-25 15:23:42,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-02-25 15:23:42,425 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-02-25 15:23:42,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:42,425 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-02-25 15:23:42,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-02-25 15:23:42,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:42,427 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:42,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:42,427 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:42,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:42,427 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-02-25 15:23:42,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:42,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:42,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:42,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:42,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:42,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:42,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:42,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:42,583 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:42,584 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-02-25 15:23:42,585 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:42,586 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:42,588 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:42,589 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:23:42,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:42,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:42,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:42,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:42,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:42,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:42,605 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:42,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:42,630 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:42,631 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,639 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,649 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,666 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,685 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,708 INFO L467 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 21 treesize of output 24 [2019-02-25 15:23:42,711 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:42,715 INFO L467 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 26 treesize of output 40 [2019-02-25 15:23:42,717 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:42,720 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:42,727 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:42,727 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,753 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,774 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,790 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,804 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,816 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,849 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:42,850 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:43,064 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-25 15:23:43,074 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,083 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 15:23:43,084 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:23:43,189 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-02-25 15:23:43,189 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-02-25 15:23:43,441 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-02-25 15:23:43,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,455 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,465 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 83 [2019-02-25 15:23:43,466 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:23:43,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,619 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,621 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 69 [2019-02-25 15:23:43,622 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,706 INFO L301 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-02-25 15:23:43,706 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-02-25 15:23:43,907 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-02-25 15:23:43,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,917 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,929 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:43,981 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 93 [2019-02-25 15:23:43,984 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:23:44,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,241 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:44,242 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:23:44,242 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:44,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,432 INFO L467 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 50 treesize of output 78 [2019-02-25 15:23:44,432 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:44,590 INFO L301 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-25 15:23:44,590 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:250 [2019-02-25 15:23:44,731 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 84 [2019-02-25 15:23:44,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:44,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:44,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:44,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:23:44,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:44,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:44,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:44,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:44,786 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-02-25 15:23:45,439 WARN L181 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-02-25 15:23:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:46,305 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-02-25 15:23:46,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:23:46,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:46,309 INFO L225 Difference]: With dead ends: 280 [2019-02-25 15:23:46,309 INFO L226 Difference]: Without dead ends: 279 [2019-02-25 15:23:46,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:23:46,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-25 15:23:46,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-02-25 15:23:46,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-25 15:23:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-02-25 15:23:46,348 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-02-25 15:23:46,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:46,348 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-02-25 15:23:46,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:46,348 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-02-25 15:23:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:46,349 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:46,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:46,349 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:46,349 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-02-25 15:23:46,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:46,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:46,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:46,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:46,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:23:46,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:23:46,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:23:46,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:46,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:23:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:23:46,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:23:46,584 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-02-25 15:23:46,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:46,689 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-02-25 15:23:46,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:23:46,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:23:46,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:46,693 INFO L225 Difference]: With dead ends: 201 [2019-02-25 15:23:46,693 INFO L226 Difference]: Without dead ends: 198 [2019-02-25 15:23:46,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:23:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-25 15:23:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-02-25 15:23:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-25 15:23:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-02-25 15:23:46,735 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-02-25 15:23:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:46,735 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-02-25 15:23:46,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:23:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-02-25 15:23:46,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:46,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:46,736 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:46,736 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-02-25 15:23:46,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:46,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:46,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:46,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:46,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:23:46,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:46,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:46,795 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:46,795 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-02-25 15:23:46,796 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:46,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:46,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:46,798 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:46,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:46,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:46,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:46,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:46,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:46,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:46,814 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:23:46,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:46,863 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:46,863 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,878 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,891 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,932 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,956 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:46,988 INFO L467 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 21 treesize of output 24 [2019-02-25 15:23:46,990 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:46,993 INFO L467 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 26 treesize of output 40 [2019-02-25 15:23:47,000 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:47,002 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:47,011 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:47,012 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,037 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,058 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,074 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,087 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,099 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,132 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:47,132 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:47,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:47,174 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:47,174 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,203 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:47,204 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:47,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:47,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:47,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:47,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:47,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:47,229 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:47,230 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:47,230 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,257 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:47,257 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-25 15:23:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:47,275 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:47,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:47,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:47,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:47,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:47,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:47,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:47,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:47,315 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-02-25 15:23:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:47,653 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-02-25 15:23:47,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:47,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:23:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:47,657 INFO L225 Difference]: With dead ends: 208 [2019-02-25 15:23:47,657 INFO L226 Difference]: Without dead ends: 207 [2019-02-25 15:23:47,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-25 15:23:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-02-25 15:23:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-25 15:23:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-02-25 15:23:47,688 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-02-25 15:23:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:47,688 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-02-25 15:23:47,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-02-25 15:23:47,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:47,689 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:47,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:47,690 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:47,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:47,690 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-02-25 15:23:47,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:47,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:47,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:47,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:47,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:47,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:47,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:47,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:47,761 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-02-25 15:23:47,762 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:47,762 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:47,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:47,764 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:47,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:47,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:47,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:47,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:47,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:47,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:23:47,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:47,810 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:23:47,810 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,822 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,839 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,862 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,889 INFO L467 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 21 treesize of output 24 [2019-02-25 15:23:47,893 INFO L467 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 24 treesize of output 26 [2019-02-25 15:23:47,896 INFO L467 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 26 treesize of output 36 [2019-02-25 15:23:47,901 INFO L467 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 28 treesize of output 50 [2019-02-25 15:23:47,908 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:23:47,922 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:23:47,923 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,947 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,966 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,981 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:47,993 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:48,012 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:48,043 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:48,043 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:23:48,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:48,081 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:23:48,081 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:48,106 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:48,107 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:23:48,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:48,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:48,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:48,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:48,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:48,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:48,135 INFO L467 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 62 [2019-02-25 15:23:48,135 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:48,158 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:48,159 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-02-25 15:23:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:48,180 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:48,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:48,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:48,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:48,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:48,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:48,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:48,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:48,227 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-02-25 15:23:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:48,536 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-02-25 15:23:48,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:48,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:23:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:48,539 INFO L225 Difference]: With dead ends: 210 [2019-02-25 15:23:48,539 INFO L226 Difference]: Without dead ends: 208 [2019-02-25 15:23:48,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-25 15:23:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-02-25 15:23:48,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-25 15:23:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-02-25 15:23:48,573 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-02-25 15:23:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:48,573 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-02-25 15:23:48,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-02-25 15:23:48,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:48,574 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:48,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:48,574 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:48,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:48,575 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-02-25 15:23:48,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:48,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:48,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:48,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:48,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:48,719 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:23:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:48,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:48,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:48,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:23:48,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:23:48,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:48,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:48,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:23:48,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:23:48,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:23:48,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:23:48,756 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:23:48,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:48,798 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:48,798 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:48,818 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:48,825 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:48,839 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:48,866 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:48,899 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:48,941 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:23:48,943 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:23:48,945 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:48,947 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:23:48,950 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:48,961 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:23:48,962 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:48,995 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:49,015 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:49,034 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:49,046 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:49,057 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:49,106 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:49,106 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:23:49,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,141 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:49,142 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:49,184 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:49,184 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:49,216 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,216 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,220 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,223 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:49,223 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:49,265 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:49,265 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:23:49,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,299 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:49,304 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:49,305 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:49,306 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:49,345 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:49,346 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:23:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:49,368 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:49,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:49,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:23:49,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:49,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:49,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:49,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:49,425 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-02-25 15:23:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:50,957 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-02-25 15:23:50,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:23:50,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:50,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:50,961 INFO L225 Difference]: With dead ends: 242 [2019-02-25 15:23:50,961 INFO L226 Difference]: Without dead ends: 240 [2019-02-25 15:23:50,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 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-02-25 15:23:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-02-25 15:23:51,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-02-25 15:23:51,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-25 15:23:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-02-25 15:23:51,002 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-02-25 15:23:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:51,002 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-02-25 15:23:51,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-02-25 15:23:51,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:51,003 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:51,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:51,004 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-02-25 15:23:51,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:51,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:51,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:23:51,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:51,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:51,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:51,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:51,065 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:51,065 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:51,065 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-02-25 15:23:51,066 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:51,066 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:51,069 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:51,069 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:23:51,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:51,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:51,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:51,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:51,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:51,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:51,084 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:23:51,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:51,089 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:51,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,098 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:51,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,107 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:51,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,117 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:51,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,132 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:51,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,150 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:23:51,151 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,208 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,231 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,250 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,266 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,279 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,341 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:51,341 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,354 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,367 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,388 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,414 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,443 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,489 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:51,490 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:23:51,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,524 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:51,524 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,567 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:51,567 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:51,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,632 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:51,633 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,676 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:51,677 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:23:51,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:51,714 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:51,715 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:51,715 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:51,757 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:51,757 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:23:51,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:51,781 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:51,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:51,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:23:51,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:51,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:51,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:51,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:51,838 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-02-25 15:23:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:52,449 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-02-25 15:23:52,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:23:52,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:52,453 INFO L225 Difference]: With dead ends: 249 [2019-02-25 15:23:52,453 INFO L226 Difference]: Without dead ends: 247 [2019-02-25 15:23:52,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:23:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-02-25 15:23:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-02-25 15:23:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-02-25 15:23:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-02-25 15:23:52,486 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-02-25 15:23:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:52,486 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-02-25 15:23:52,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:52,486 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-02-25 15:23:52,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:52,487 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:52,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:52,487 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:52,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:52,488 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-02-25 15:23:52,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:52,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:52,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:52,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:52,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:52,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:52,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:52,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:52,652 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:52,652 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-02-25 15:23:52,656 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:52,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:52,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:52,658 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:23:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:52,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:52,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:52,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:52,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:52,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:52,672 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:52,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:52,677 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:52,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:52,680 INFO L467 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 24 treesize of output 30 [2019-02-25 15:23:52,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:52,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:52,685 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:23:52,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:52,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:52,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:52,691 INFO L467 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 28 treesize of output 54 [2019-02-25 15:23:52,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:52,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:52,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:52,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:52,707 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:23:52,718 INFO L467 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 32 treesize of output 71 [2019-02-25 15:23:52,719 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:52,746 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:52,770 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:52,788 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:52,802 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:52,817 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:52,865 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:52,866 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:52,876 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:52,887 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:52,904 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:52,923 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:52,957 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:52,957 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:23:53,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,017 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:23:53,017 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:53,044 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:53,045 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:23:53,070 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,074 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,075 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:23:53,076 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:53,104 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:53,104 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-25 15:23:53,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,152 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,153 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:53,156 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:53,157 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:23:53,157 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:53,183 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:53,183 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:23:53,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:53,206 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:53,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:53,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:23:53,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:53,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:23:53,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:23:53,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:53,263 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-02-25 15:23:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:53,847 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-02-25 15:23:53,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:23:53,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:23:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:53,851 INFO L225 Difference]: With dead ends: 260 [2019-02-25 15:23:53,851 INFO L226 Difference]: Without dead ends: 258 [2019-02-25 15:23:53,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:23:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-25 15:23:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-02-25 15:23:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-25 15:23:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-02-25 15:23:53,885 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-02-25 15:23:53,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:53,885 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-02-25 15:23:53,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:23:53,885 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-02-25 15:23:53,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:53,886 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:53,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:53,886 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:53,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:53,886 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-02-25 15:23:53,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:53,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:53,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:53,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:53,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:54,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:54,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:54,001 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:54,002 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-02-25 15:23:54,004 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:54,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:54,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:54,008 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:54,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:54,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:54,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:54,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:54,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:54,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:54,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:23:54,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:54,027 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:54,033 INFO L467 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 24 treesize of output 26 [2019-02-25 15:23:54,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,039 INFO L467 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 26 treesize of output 36 [2019-02-25 15:23:54,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,048 INFO L467 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 28 treesize of output 50 [2019-02-25 15:23:54,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,054 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,055 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:23:54,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,067 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:23:54,068 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,108 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,128 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,145 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,159 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,171 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,222 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:23:54,223 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,236 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,246 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,264 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,289 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,333 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:54,333 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:23:54,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,360 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:23:54,361 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,402 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:54,403 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:23:54,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:54,434 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:54,435 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:23:54,435 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:54,476 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:54,476 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-02-25 15:23:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:54,500 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:54,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:54,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:54,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:54,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:54,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:54,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:54,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:54,543 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-02-25 15:23:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:54,843 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-02-25 15:23:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:54,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:23:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:54,847 INFO L225 Difference]: With dead ends: 244 [2019-02-25 15:23:54,847 INFO L226 Difference]: Without dead ends: 243 [2019-02-25 15:23:54,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-25 15:23:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-02-25 15:23:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-25 15:23:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-02-25 15:23:54,884 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-02-25 15:23:54,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:54,884 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-02-25 15:23:54,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-02-25 15:23:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:23:54,885 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:54,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:23:54,886 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:54,886 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-02-25 15:23:54,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:54,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:54,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:54,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:54,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:54,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:54,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:54,995 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:23:54,995 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-02-25 15:23:54,996 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:54,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:54,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:54,998 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:23:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:54,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:54,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:54,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:23:55,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:55,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:55,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:23:55,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:55,026 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:23:55,030 INFO L467 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 24 treesize of output 26 [2019-02-25 15:23:55,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,036 INFO L467 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 26 treesize of output 36 [2019-02-25 15:23:55,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,046 INFO L467 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 28 treesize of output 50 [2019-02-25 15:23:55,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,053 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:23:55,064 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:23:55,064 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,116 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,138 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,156 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,170 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,183 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,220 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:23:55,221 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,229 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,242 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,258 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:55,289 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:55,290 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:23:55,472 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-02-25 15:23:55,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:55,525 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:23:55,531 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-25 15:23:55,901 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-02-25 15:23:55,902 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:361 [2019-02-25 15:23:56,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,007 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:56,008 INFO L467 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 58 treesize of output 66 [2019-02-25 15:23:56,008 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:56,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,109 INFO L467 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 58 treesize of output 68 [2019-02-25 15:23:56,110 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:56,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,203 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:56,205 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 51 [2019-02-25 15:23:56,205 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:56,275 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-02-25 15:23:56,276 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:170, output treesize:126 [2019-02-25 15:23:56,404 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-25 15:23:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:23:56,409 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:56,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-02-25 15:23:56,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:56,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:56,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:56,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:56,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:56,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:56,478 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-02-25 15:23:56,872 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-02-25 15:23:57,213 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-02-25 15:24:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:07,870 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-02-25 15:24:07,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:24:07,871 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:07,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:07,874 INFO L225 Difference]: With dead ends: 273 [2019-02-25 15:24:07,875 INFO L226 Difference]: Without dead ends: 272 [2019-02-25 15:24:07,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:24:07,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-02-25 15:24:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-02-25 15:24:07,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-02-25 15:24:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-02-25 15:24:07,910 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-02-25 15:24:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:07,910 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-02-25 15:24:07,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:07,910 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-02-25 15:24:07,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:07,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:07,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:07,911 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:07,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:07,912 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-02-25 15:24:07,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:07,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:07,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:07,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:07,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:08,223 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2019-02-25 15:24:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:08,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:08,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:08,355 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:24:08,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:24:08,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:08,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:08,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:24:08,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:24:08,372 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:24:08,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:24:08,373 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:24:08,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:08,377 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:08,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,380 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:08,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,385 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:08,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,393 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:08,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,409 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:08,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,422 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:24:08,423 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,465 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,488 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,507 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,521 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,536 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,596 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:08,597 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,613 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,622 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,640 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,668 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,697 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,745 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:08,746 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:24:08,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,775 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:08,776 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,820 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:08,821 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:08,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,891 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:08,892 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:08,893 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,940 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:08,940 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:24:08,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,976 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:24:08,977 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,021 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:09,021 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-25 15:24:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:09,042 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:09,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:09,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:24:09,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:09,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:09,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:09,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:09,093 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-02-25 15:24:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:09,919 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-02-25 15:24:09,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:24:09,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:09,924 INFO L225 Difference]: With dead ends: 274 [2019-02-25 15:24:09,924 INFO L226 Difference]: Without dead ends: 273 [2019-02-25 15:24:09,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:24:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-02-25 15:24:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-02-25 15:24:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-25 15:24:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-02-25 15:24:09,962 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-02-25 15:24:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:09,962 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-02-25 15:24:09,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-02-25 15:24:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:09,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:09,963 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:09,964 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:09,964 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-02-25 15:24:09,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:09,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:09,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:24:09,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:09,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:10,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:10,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:10,120 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:10,121 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-02-25 15:24:10,121 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:10,122 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:10,124 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:10,124 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:24:10,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:10,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:10,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:10,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:10,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:10,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:10,152 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:10,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:10,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:10,178 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,189 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,203 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,222 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,250 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,285 INFO L467 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 21 treesize of output 24 [2019-02-25 15:24:10,290 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:24:10,295 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:24:10,299 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:24:10,303 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:24:10,307 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:24:10,307 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,342 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,361 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,376 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,389 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,401 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,445 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:10,445 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-02-25 15:24:10,465 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:10,466 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:24:10,466 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:10,513 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:10,513 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-02-25 15:24:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:10,531 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:10,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:10,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:24:10,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:10,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:24:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:24:10,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:24:10,561 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-02-25 15:24:10,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:10,778 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-02-25 15:24:10,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:24:10,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-25 15:24:10,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:10,781 INFO L225 Difference]: With dead ends: 242 [2019-02-25 15:24:10,781 INFO L226 Difference]: Without dead ends: 241 [2019-02-25 15:24:10,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:24:10,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-02-25 15:24:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-02-25 15:24:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-25 15:24:10,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-02-25 15:24:10,818 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-02-25 15:24:10,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:10,818 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-02-25 15:24:10,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:24:10,818 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-02-25 15:24:10,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:10,818 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:10,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:10,819 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:10,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:10,819 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-02-25 15:24:10,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:10,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:10,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:10,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:10,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:10,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:10,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:10,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:10,962 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-02-25 15:24:10,962 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:10,962 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:10,965 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:10,965 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:10,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:10,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:10,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:10,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:10,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:10,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:10,981 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:24:10,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:11,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:11,011 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,027 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,037 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,056 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,084 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,114 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,151 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:24:11,154 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:24:11,158 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:11,161 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:24:11,165 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:11,169 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:24:11,169 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,206 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,227 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,242 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,254 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,267 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,314 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:11,314 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:24:11,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:11,351 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,396 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:11,397 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:11,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,434 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:11,434 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,479 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:11,479 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:24:11,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,510 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,511 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,518 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:11,519 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:11,519 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,564 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:11,564 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:24:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:11,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:11,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:11,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:11,649 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:11,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:11,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:11,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:11,649 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-02-25 15:24:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:12,361 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-02-25 15:24:12,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:12,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:12,365 INFO L225 Difference]: With dead ends: 276 [2019-02-25 15:24:12,366 INFO L226 Difference]: Without dead ends: 274 [2019-02-25 15:24:12,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-25 15:24:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-02-25 15:24:12,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-25 15:24:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-02-25 15:24:12,409 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-02-25 15:24:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:12,409 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-02-25 15:24:12,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-02-25 15:24:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:12,410 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:12,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:12,410 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:12,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:12,410 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-02-25 15:24:12,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:12,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:12,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:12,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:12,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:12,590 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-02-25 15:24:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:12,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:12,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:12,600 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:12,601 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-02-25 15:24:12,602 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:12,602 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:12,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:12,605 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:12,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:12,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:12,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:12,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:12,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:12,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:12,626 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:24:12,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:12,651 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:12,652 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,663 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,670 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,683 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,702 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,728 INFO L467 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 21 treesize of output 24 [2019-02-25 15:24:12,731 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:12,735 INFO L467 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 26 treesize of output 40 [2019-02-25 15:24:12,738 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:12,741 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:12,749 INFO L467 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 32 treesize of output 71 [2019-02-25 15:24:12,750 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,777 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,796 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,812 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,824 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,835 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,868 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:12,869 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:24:12,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:12,906 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:24:12,906 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:12,935 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:12,935 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:24:12,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,111 INFO L292 Elim1Store]: Index analysis took 161 ms [2019-02-25 15:24:13,112 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:24:13,113 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,506 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:13,506 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:24:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:13,709 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:13,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:13,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:13,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:13,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:13,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:13,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:13,787 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-02-25 15:24:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:14,185 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-02-25 15:24:14,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:14,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:14,189 INFO L225 Difference]: With dead ends: 288 [2019-02-25 15:24:14,189 INFO L226 Difference]: Without dead ends: 287 [2019-02-25 15:24:14,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:24:14,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-25 15:24:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-02-25 15:24:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-02-25 15:24:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-02-25 15:24:14,245 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-02-25 15:24:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:14,245 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-02-25 15:24:14,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-02-25 15:24:14,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:14,246 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:14,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:14,246 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:14,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:14,246 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-02-25 15:24:14,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:14,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:14,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:14,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:14,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:14,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:14,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:14,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:14,324 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-02-25 15:24:14,325 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:14,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:14,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:14,327 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:14,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:14,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:14,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:14,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:14,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:14,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:24:14,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:14,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:14,356 INFO L467 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 24 treesize of output 26 [2019-02-25 15:24:14,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,369 INFO L467 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 26 treesize of output 36 [2019-02-25 15:24:14,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,376 INFO L467 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 28 treesize of output 50 [2019-02-25 15:24:14,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,384 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:24:14,394 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:24:14,395 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,422 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,442 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,460 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,471 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,485 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,524 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:24:14,525 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,534 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,544 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,561 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,592 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:14,593 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-25 15:24:14,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,647 INFO L467 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 66 [2019-02-25 15:24:14,648 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:14,741 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:14,741 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-25 15:24:14,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,776 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 47 [2019-02-25 15:24:14,777 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,795 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:14,795 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-02-25 15:24:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:14,811 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:14,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:14,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:24:14,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:14,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:14,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:14,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:14,867 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-02-25 15:24:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:15,299 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-02-25 15:24:15,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:24:15,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:15,304 INFO L225 Difference]: With dead ends: 319 [2019-02-25 15:24:15,304 INFO L226 Difference]: Without dead ends: 318 [2019-02-25 15:24:15,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:15,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-02-25 15:24:15,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-02-25 15:24:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-25 15:24:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-02-25 15:24:15,367 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-02-25 15:24:15,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:15,367 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-02-25 15:24:15,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-02-25 15:24:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:15,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:15,368 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:24:15,369 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:15,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:15,369 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-02-25 15:24:15,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:15,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:15,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:15,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:15,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:15,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:15,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:15,426 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:15,426 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-02-25 15:24:15,427 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:15,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:15,429 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:15,429 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 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 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:24:15,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:15,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:15,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:15,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:15,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:15,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:15,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:24:15,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:15,477 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:24:15,478 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,491 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,508 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,532 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,559 INFO L467 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 21 treesize of output 24 [2019-02-25 15:24:15,564 INFO L467 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 24 treesize of output 26 [2019-02-25 15:24:15,569 INFO L467 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 26 treesize of output 36 [2019-02-25 15:24:15,574 INFO L467 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 28 treesize of output 50 [2019-02-25 15:24:15,620 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:24:15,772 INFO L292 Elim1Store]: Index analysis took 149 ms [2019-02-25 15:24:15,772 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:24:15,773 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,009 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,026 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,040 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,051 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,062 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,091 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:16,091 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-25 15:24:16,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,176 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:24:16,177 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,519 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:16,519 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:24:16,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,544 INFO L467 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 62 [2019-02-25 15:24:16,544 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,569 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:16,570 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-02-25 15:24:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:16,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:16,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:16,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:16,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-25 15:24:16,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:16,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:24:16,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:24:16,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:16,625 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-02-25 15:24:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:16,831 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-02-25 15:24:16,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:16,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-25 15:24:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:16,836 INFO L225 Difference]: With dead ends: 290 [2019-02-25 15:24:16,836 INFO L226 Difference]: Without dead ends: 289 [2019-02-25 15:24:16,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-25 15:24:16,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-02-25 15:24:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-25 15:24:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-02-25 15:24:16,898 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-02-25 15:24:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:16,898 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-02-25 15:24:16,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:24:16,898 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-02-25 15:24:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:16,899 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:16,899 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-25 15:24:16,900 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:16,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:16,900 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-02-25 15:24:16,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:16,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:16,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:16,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:16,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:16,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:16,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:24:16,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:24:16,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:16,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:16,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:24:17,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:24:17,006 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:24:17,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:24:17,007 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:17,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:17,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:17,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,019 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:17,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,024 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:17,032 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,036 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:17,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,045 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:17,057 INFO L467 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 32 treesize of output 71 [2019-02-25 15:24:17,057 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,084 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,103 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,120 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,134 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,147 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,185 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:17,186 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,195 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,204 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,216 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,233 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,269 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:17,270 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:24:17,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,302 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:24:17,302 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,328 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:17,328 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:24:17,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,353 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:24:17,353 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,380 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:17,380 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-25 15:24:17,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,407 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 66 [2019-02-25 15:24:17,408 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,435 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:17,435 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-25 15:24:17,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,455 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,457 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,460 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,463 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:17,464 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 66 [2019-02-25 15:24:17,465 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:17,492 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:17,492 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-25 15:24:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:17,509 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:17,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:17,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:24:17,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:17,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:24:17,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:24:17,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:24:17,558 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-02-25 15:24:18,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:18,109 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-02-25 15:24:18,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:24:18,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:24:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:18,114 INFO L225 Difference]: With dead ends: 423 [2019-02-25 15:24:18,114 INFO L226 Difference]: Without dead ends: 421 [2019-02-25 15:24:18,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:24:18,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-02-25 15:24:18,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-02-25 15:24:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-02-25 15:24:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-02-25 15:24:18,187 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-02-25 15:24:18,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:18,187 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-02-25 15:24:18,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:24:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-02-25 15:24:18,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:18,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:18,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:18,189 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:18,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:18,189 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-02-25 15:24:18,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:18,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:24:18,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:18,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:18,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:18,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:18,327 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:18,327 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-02-25 15:24:18,328 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:18,328 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:18,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:18,330 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:18,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:18,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:18,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:18,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:18,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:18,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:18,350 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:24:18,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:18,353 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:18,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,356 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:18,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,361 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:18,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,367 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:18,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,374 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:18,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,382 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:24:18,383 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,421 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,443 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,460 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,475 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,487 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,541 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:18,541 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,582 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,592 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,607 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,624 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,651 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,695 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:18,695 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:24:18,724 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,724 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:18,725 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,765 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:18,765 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:18,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,800 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:18,801 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,842 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:18,842 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:24:18,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,872 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,873 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,878 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:18,879 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:18,879 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,918 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:18,918 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:24:18,941 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:18,941 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:18,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:18,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:18,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:18,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:18,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:18,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:18,997 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-02-25 15:24:19,605 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-02-25 15:24:20,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:20,042 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-02-25 15:24:20,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:20,043 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:24:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:20,048 INFO L225 Difference]: With dead ends: 368 [2019-02-25 15:24:20,048 INFO L226 Difference]: Without dead ends: 366 [2019-02-25 15:24:20,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-25 15:24:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-02-25 15:24:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-25 15:24:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-02-25 15:24:20,114 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-02-25 15:24:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:20,114 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-02-25 15:24:20,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:20,114 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-02-25 15:24:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:20,115 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:20,116 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:24:20,116 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:20,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:20,116 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-02-25 15:24:20,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:20,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:20,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:20,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:20,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:20,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:20,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:20,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:24:20,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:24:20,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:20,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:20,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:24:20,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:24:20,193 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:24:20,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:24:20,194 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:24:20,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:20,198 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:20,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,206 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:20,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,212 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:20,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,222 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:20,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,232 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:20,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,242 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:24:20,243 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,281 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,303 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,321 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,336 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,349 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,400 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:20,401 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,414 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,426 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,443 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,467 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,494 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,536 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:20,536 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:24:20,562 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,563 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:20,563 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,604 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:20,604 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:20,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,639 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:20,639 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,679 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:20,680 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:24:20,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,709 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:20,710 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:20,711 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,749 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:20,749 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:24:20,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,788 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 93 [2019-02-25 15:24:20,788 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,828 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:20,828 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-02-25 15:24:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:20,851 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:20,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:20,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:20,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:24:20,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:20,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:24:20,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:24:20,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:24:20,915 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-02-25 15:24:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:21,662 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-02-25 15:24:21,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:24:21,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:24:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:21,667 INFO L225 Difference]: With dead ends: 407 [2019-02-25 15:24:21,667 INFO L226 Difference]: Without dead ends: 401 [2019-02-25 15:24:21,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:24:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-02-25 15:24:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-02-25 15:24:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-25 15:24:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-02-25 15:24:21,746 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-02-25 15:24:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:21,746 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-02-25 15:24:21,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:24:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-02-25 15:24:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:21,747 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:21,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:21,747 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:21,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:21,747 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-02-25 15:24:21,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:21,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:21,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:24:21,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:21,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:21,964 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-02-25 15:24:22,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:22,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:22,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:22,038 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:22,039 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-02-25 15:24:22,040 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:22,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:22,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:22,042 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:24:22,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:22,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:22,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:22,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:22,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:22,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:22,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:24:22,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:22,069 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:22,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,072 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:22,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,076 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,076 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:22,081 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,082 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,083 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,084 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:22,088 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,093 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:22,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,101 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:24:22,101 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,140 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,163 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,180 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,195 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,208 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,260 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:22,261 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,276 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,290 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,307 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,326 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,353 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,396 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:22,397 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:24:22,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,432 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:22,433 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,490 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:22,490 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:22,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,520 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,524 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:22,525 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,565 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:22,565 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-25 15:24:22,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,600 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,602 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:22,603 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:22,604 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,642 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:22,642 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:24:22,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,668 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:22,677 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:22,678 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:24:22,679 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:22,719 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:22,719 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:24:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:22,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:22,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:22,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:24:22,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:22,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:24:22,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:24:22,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:24:22,858 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-02-25 15:24:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:24,094 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-02-25 15:24:24,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-25 15:24:24,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:24:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:24,101 INFO L225 Difference]: With dead ends: 645 [2019-02-25 15:24:24,102 INFO L226 Difference]: Without dead ends: 643 [2019-02-25 15:24:24,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:24:24,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-02-25 15:24:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-02-25 15:24:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-02-25 15:24:24,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-02-25 15:24:24,208 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-02-25 15:24:24,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:24,208 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-02-25 15:24:24,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:24:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-02-25 15:24:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:24,209 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:24,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:24,210 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:24,210 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-02-25 15:24:24,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:24,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:24,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:24,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:24,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:24,364 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-25 15:24:24,806 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-02-25 15:24:24,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:24,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:24,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:24,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:24,871 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-02-25 15:24:24,871 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:24,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:24,880 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:24,881 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:24,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:24,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:24,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:24,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:24,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:24,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:24:24,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:24,921 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:24,961 INFO L467 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 24 treesize of output 26 [2019-02-25 15:24:24,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:24,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:24,970 INFO L467 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 26 treesize of output 36 [2019-02-25 15:24:24,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:24,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:24,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:24,977 INFO L467 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 28 treesize of output 50 [2019-02-25 15:24:24,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:24,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:24,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:24,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:24,986 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:24:24,996 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:24:24,996 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,022 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,041 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,056 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,068 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,079 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,114 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:24:25,114 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,121 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,130 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,145 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,174 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:25,174 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:24:25,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,213 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:24:25,214 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,238 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:25,238 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:24:25,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,260 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,273 INFO L467 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 68 [2019-02-25 15:24:25,274 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:25,350 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:25,350 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-02-25 15:24:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:25,421 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:25,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:25,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-25 15:24:25,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:25,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:24:25,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:24:25,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:25,458 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-02-25 15:24:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:26,001 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-02-25 15:24:26,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:24:26,001 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:24:26,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:26,008 INFO L225 Difference]: With dead ends: 527 [2019-02-25 15:24:26,008 INFO L226 Difference]: Without dead ends: 524 [2019-02-25 15:24:26,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:24:26,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-02-25 15:24:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-02-25 15:24:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-02-25 15:24:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-02-25 15:24:26,128 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-02-25 15:24:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:26,128 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-02-25 15:24:26,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:24:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-02-25 15:24:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:26,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:26,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:26,129 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:26,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:26,129 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-02-25 15:24:26,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:26,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:26,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:26,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:26,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:26,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:26,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:26,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:26,195 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-02-25 15:24:26,196 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:26,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:26,198 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:26,198 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:26,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:26,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:26,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:26,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:26,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:26,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:26,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:24:26,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:26,218 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:26,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,227 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:26,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,233 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:26,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,243 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:26,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,255 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:26,263 INFO L467 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 32 treesize of output 71 [2019-02-25 15:24:26,264 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,292 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,312 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,329 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,343 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,354 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,396 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:26,396 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,406 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,414 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,427 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,444 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,474 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:26,475 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:24:26,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,524 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:24:26,524 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,550 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:26,550 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:24:26,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,581 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:24:26,581 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,608 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:26,608 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-25 15:24:26,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:26,640 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:26,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:24:26,641 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,665 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:26,665 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:24:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:26,688 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:26,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:26,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:26,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:26,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:26,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:26,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:26,742 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-02-25 15:24:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:27,333 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-02-25 15:24:27,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:27,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:24:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:27,340 INFO L225 Difference]: With dead ends: 534 [2019-02-25 15:24:27,340 INFO L226 Difference]: Without dead ends: 533 [2019-02-25 15:24:27,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:27,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-02-25 15:24:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-02-25 15:24:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-02-25 15:24:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-02-25 15:24:27,469 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-02-25 15:24:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:27,469 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-02-25 15:24:27,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-02-25 15:24:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:27,470 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:27,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:27,471 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:27,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:27,471 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-02-25 15:24:27,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:27,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:27,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:27,623 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:24:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:27,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:27,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:27,769 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:27,769 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-02-25 15:24:27,770 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:27,770 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:27,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:27,772 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:27,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:27,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:27,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:27,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:27,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:27,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:27,790 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:27,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:27,794 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:27,800 INFO L467 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 24 treesize of output 26 [2019-02-25 15:24:27,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,806 INFO L467 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 26 treesize of output 36 [2019-02-25 15:24:27,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,813 INFO L467 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 28 treesize of output 50 [2019-02-25 15:24:27,819 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,827 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:24:27,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,841 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:24:27,842 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,877 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,897 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,912 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,925 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,938 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:27,985 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,999 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,015 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,036 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,060 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,101 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:28,101 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:24:28,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,136 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:24:28,137 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,208 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:28,209 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 15:24:28,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,243 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,245 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:24:28,246 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,314 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:28,315 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-25 15:24:28,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,349 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:28,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:24:28,350 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,387 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:28,387 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-25 15:24:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:28,409 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:28,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:28,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:28,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:28,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:28,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:28,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:28,463 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-02-25 15:24:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:29,055 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-02-25 15:24:29,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:29,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:24:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:29,061 INFO L225 Difference]: With dead ends: 543 [2019-02-25 15:24:29,061 INFO L226 Difference]: Without dead ends: 542 [2019-02-25 15:24:29,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-02-25 15:24:29,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-02-25 15:24:29,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-02-25 15:24:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-02-25 15:24:29,176 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-02-25 15:24:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:29,176 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-02-25 15:24:29,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:29,177 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-02-25 15:24:29,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:29,178 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:29,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:29,178 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-02-25 15:24:29,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:29,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:29,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:29,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:29,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:29,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:29,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:29,237 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:29,237 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-02-25 15:24:29,237 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:29,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:29,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:29,239 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:29,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:29,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:29,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:29,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:29,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:29,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:29,254 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:24:29,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:29,261 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:29,265 INFO L467 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 24 treesize of output 26 [2019-02-25 15:24:29,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,273 INFO L467 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 26 treesize of output 36 [2019-02-25 15:24:29,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,284 INFO L467 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 28 treesize of output 50 [2019-02-25 15:24:29,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,297 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:24:29,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,312 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,321 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:24:29,321 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,358 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,379 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,395 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,408 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,435 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,479 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:29,480 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,490 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,498 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,514 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,539 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,580 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:29,580 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:24:29,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,614 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:24:29,614 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,653 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:29,653 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 15:24:29,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,689 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:24:29,689 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,726 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:29,726 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-25 15:24:29,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,756 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:29,761 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:29,762 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:24:29,762 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:29,798 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:29,799 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-25 15:24:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:29,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:29,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:29,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:29,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:29,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:29,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:29,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:29,878 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-02-25 15:24:30,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:30,555 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-02-25 15:24:30,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:30,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:24:30,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:30,560 INFO L225 Difference]: With dead ends: 537 [2019-02-25 15:24:30,560 INFO L226 Difference]: Without dead ends: 536 [2019-02-25 15:24:30,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-02-25 15:24:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-02-25 15:24:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-02-25 15:24:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-02-25 15:24:30,680 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-02-25 15:24:30,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:30,680 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-02-25 15:24:30,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-02-25 15:24:30,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:30,681 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:30,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:30,681 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:30,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:30,681 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-02-25 15:24:30,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:30,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:30,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:30,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:30,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:30,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:30,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:30,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:30,785 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-02-25 15:24:30,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:30,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:30,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:30,789 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:30,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:30,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:30,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:30,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:30,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:30,833 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:24:30,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:30,851 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:30,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,857 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:30,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,862 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:30,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,869 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:30,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,878 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:30,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:30,886 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:24:30,887 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:30,939 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:30,961 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:30,979 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:30,993 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,006 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,059 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:31,060 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,075 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,081 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,093 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,114 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,141 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,184 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:31,184 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:24:31,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,219 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:31,219 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,259 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:31,260 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:31,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,292 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:31,293 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:31,294 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,334 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:31,335 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:61 [2019-02-25 15:24:31,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,364 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:24:31,365 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,406 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:31,406 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-25 15:24:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:31,427 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:31,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:31,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:31,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:31,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:31,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:31,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:31,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:31,487 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-02-25 15:24:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:32,183 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-02-25 15:24:32,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:32,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:24:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:32,188 INFO L225 Difference]: With dead ends: 588 [2019-02-25 15:24:32,188 INFO L226 Difference]: Without dead ends: 587 [2019-02-25 15:24:32,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-02-25 15:24:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-02-25 15:24:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-02-25 15:24:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-02-25 15:24:32,314 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-02-25 15:24:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:32,314 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-02-25 15:24:32,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:32,315 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-02-25 15:24:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:32,316 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:32,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:32,316 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:32,316 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-02-25 15:24:32,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:32,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:32,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:32,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:32,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:32,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:32,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:32,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:32,370 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-02-25 15:24:32,371 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:32,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:32,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:32,374 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:32,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:32,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:32,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:32,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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:32,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:32,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:32,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:32,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:32,416 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:32,420 INFO L467 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 24 treesize of output 26 [2019-02-25 15:24:32,467 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,491 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,492 INFO L467 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 26 treesize of output 36 [2019-02-25 15:24:32,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,525 INFO L467 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 28 treesize of output 50 [2019-02-25 15:24:32,529 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,531 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:24:32,537 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,543 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:24:32,544 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,581 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,601 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,617 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,630 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,641 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,688 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:32,688 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,701 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,714 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,735 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,760 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,800 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:32,800 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:24:32,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,827 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:24:32,827 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,866 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:32,866 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:24:32,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,894 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:32,895 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:24:32,896 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,933 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:32,934 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:57 [2019-02-25 15:24:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:32,952 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:32,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:32,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:32,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:32,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:32,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:32,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:32,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:32,990 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-02-25 15:24:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:33,470 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-02-25 15:24:33,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:33,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:24:33,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:33,474 INFO L225 Difference]: With dead ends: 558 [2019-02-25 15:24:33,474 INFO L226 Difference]: Without dead ends: 557 [2019-02-25 15:24:33,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:33,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-02-25 15:24:33,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-02-25 15:24:33,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-02-25 15:24:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-02-25 15:24:33,612 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-02-25 15:24:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:33,612 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-02-25 15:24:33,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:33,612 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-02-25 15:24:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:33,614 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:33,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:33,614 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:33,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-02-25 15:24:33,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:33,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:33,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:33,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:33,695 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:33,695 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:33,695 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-02-25 15:24:33,696 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:33,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:33,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:33,699 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:33,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:33,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:33,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:33,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:33,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:33,735 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:24:33,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:33,800 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:33,801 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,811 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,823 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,837 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,855 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,878 INFO L467 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 21 treesize of output 24 [2019-02-25 15:24:33,880 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:33,883 INFO L467 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 26 treesize of output 40 [2019-02-25 15:24:33,886 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:33,889 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:33,896 INFO L467 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 32 treesize of output 71 [2019-02-25 15:24:33,897 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,921 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,940 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,955 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,967 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,978 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:34,009 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:34,009 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:24:34,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,045 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:24:34,045 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:34,070 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:34,071 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:24:34,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,093 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:34,094 INFO L467 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 68 [2019-02-25 15:24:34,095 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:34,121 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:34,122 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:44 [2019-02-25 15:24:34,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,144 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,151 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 70 [2019-02-25 15:24:34,151 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:34,177 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:34,177 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-25 15:24:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:34,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:34,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:34,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:24:34,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:34,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:34,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:34,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:34,238 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-02-25 15:24:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:34,916 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-02-25 15:24:34,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:24:34,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:24:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:34,920 INFO L225 Difference]: With dead ends: 795 [2019-02-25 15:24:34,920 INFO L226 Difference]: Without dead ends: 794 [2019-02-25 15:24:34,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-02-25 15:24:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-02-25 15:24:35,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-02-25 15:24:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-02-25 15:24:35,069 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-02-25 15:24:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:35,070 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-02-25 15:24:35,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:35,070 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-02-25 15:24:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:35,071 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:35,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:35,071 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:35,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-02-25 15:24:35,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:35,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:35,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:35,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:35,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:35,283 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-02-25 15:24:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:35,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:35,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:35,321 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:35,321 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-02-25 15:24:35,322 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:35,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:35,324 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:35,324 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:35,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:35,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:35,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:35,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:35,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:35,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:24:35,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:35,344 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:35,346 INFO L467 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 24 treesize of output 26 [2019-02-25 15:24:35,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,353 INFO L467 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 26 treesize of output 36 [2019-02-25 15:24:35,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,361 INFO L467 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 28 treesize of output 50 [2019-02-25 15:24:35,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,370 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:24:35,380 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:24:35,381 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,409 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,432 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,448 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,460 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,488 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,523 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:24:35,523 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,531 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,539 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,554 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,583 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:35,583 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:24:35,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,624 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:24:35,624 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,648 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:35,648 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:24:35,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,678 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:35,686 INFO L467 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 38 treesize of output 68 [2019-02-25 15:24:35,687 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:35,765 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:35,765 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:80 [2019-02-25 15:24:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:35,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:35,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:35,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:35,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-25 15:24:35,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:35,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:24:35,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:24:35,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:35,861 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-02-25 15:24:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:36,619 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-02-25 15:24:36,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:24:36,619 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:24:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:36,622 INFO L225 Difference]: With dead ends: 539 [2019-02-25 15:24:36,622 INFO L226 Difference]: Without dead ends: 538 [2019-02-25 15:24:36,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:24:36,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-02-25 15:24:36,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-02-25 15:24:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-02-25 15:24:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-02-25 15:24:36,816 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-02-25 15:24:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:36,816 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-02-25 15:24:36,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:24:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-02-25 15:24:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:36,817 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:36,817 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:24:36,817 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:36,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-02-25 15:24:36,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:36,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:36,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:36,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:37,064 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-02-25 15:24:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:37,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:37,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:37,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:24:37,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:24:37,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:37,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:37,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:37,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:37,098 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:37,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:37,103 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:37,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,107 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:37,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,111 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:37,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,117 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:37,120 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,123 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,123 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:37,131 INFO L467 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 32 treesize of output 71 [2019-02-25 15:24:37,132 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,172 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,191 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,208 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,222 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,234 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,276 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:37,277 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,286 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,295 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,305 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,322 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,353 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:37,353 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:24:37,569 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-25 15:24:37,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,587 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 15:24:37,588 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:37,687 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:37,687 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-02-25 15:24:37,888 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-02-25 15:24:37,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,895 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,895 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,898 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 69 [2019-02-25 15:24:37,899 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,986 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 79 [2019-02-25 15:24:37,987 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:38,107 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:24:38,108 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-02-25 15:24:38,326 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-02-25 15:24:38,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,354 INFO L467 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 53 treesize of output 69 [2019-02-25 15:24:38,354 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,455 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,457 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,460 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,462 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,463 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,465 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,466 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 79 [2019-02-25 15:24:38,466 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,548 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,551 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,557 INFO L467 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 50 treesize of output 66 [2019-02-25 15:24:38,557 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,630 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-02-25 15:24:38,630 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-02-25 15:24:38,846 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-25 15:24:38,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,890 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 93 [2019-02-25 15:24:38,892 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:24:39,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,138 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,140 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,141 INFO L467 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 50 treesize of output 66 [2019-02-25 15:24:39,142 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:39,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,277 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,278 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,282 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:39,283 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:24:39,283 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:39,402 INFO L301 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-25 15:24:39,402 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-02-25 15:24:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:39,528 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:39,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:39,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:24:39,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:39,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:24:39,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:24:39,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:24:39,622 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-02-25 15:24:39,871 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-02-25 15:24:40,495 WARN L181 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-02-25 15:24:41,136 WARN L181 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-02-25 15:24:41,625 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-02-25 15:24:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:42,430 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-02-25 15:24:42,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:24:42,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:24:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:42,435 INFO L225 Difference]: With dead ends: 678 [2019-02-25 15:24:42,435 INFO L226 Difference]: Without dead ends: 673 [2019-02-25 15:24:42,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:24:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-02-25 15:24:42,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-02-25 15:24:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-02-25 15:24:42,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-02-25 15:24:42,690 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-02-25 15:24:42,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:42,690 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-02-25 15:24:42,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:24:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-02-25 15:24:42,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:42,691 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:42,691 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:24:42,691 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:42,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-02-25 15:24:42,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:42,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:42,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:42,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:42,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:42,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:42,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:24:42,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:24:42,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:42,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:42,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:24:42,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:24:42,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:24:42,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:24:42,761 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:24:42,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:42,766 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:42,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,769 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:42,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,774 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:42,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,779 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:42,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,787 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:42,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,795 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:24:42,796 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,837 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,858 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,875 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,889 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,902 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,955 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:42,955 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,971 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,980 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,994 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,017 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,044 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,088 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:43,088 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:24:43,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,118 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:43,118 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,160 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:43,160 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:43,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,190 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:43,190 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,231 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:43,232 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:24:43,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,260 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,263 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,267 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 91 [2019-02-25 15:24:43,268 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,309 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:43,309 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-02-25 15:24:43,331 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:43,343 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:43,344 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:43,385 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:43,385 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-02-25 15:24:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:43,409 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:43,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:43,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:24:43,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:43,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:24:43,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:24:43,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:24:43,473 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-02-25 15:24:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:44,299 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-02-25 15:24:44,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:24:44,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:24:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:44,304 INFO L225 Difference]: With dead ends: 704 [2019-02-25 15:24:44,304 INFO L226 Difference]: Without dead ends: 703 [2019-02-25 15:24:44,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:24:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-02-25 15:24:44,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-02-25 15:24:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-02-25 15:24:44,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-02-25 15:24:44,520 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-02-25 15:24:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:44,520 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-02-25 15:24:44,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:24:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-02-25 15:24:44,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:44,521 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:44,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:44,521 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:44,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:44,521 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-02-25 15:24:44,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:44,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:44,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:24:44,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:44,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:44,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:44,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:44,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:44,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:24:44,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:24:44,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:44,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:44,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:24:44,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:24:44,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:24:44,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:24:44,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:24:44,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:44,748 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:44,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,754 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:44,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,760 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:44,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,767 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:44,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,778 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:44,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:44,787 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:24:44,787 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,829 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,852 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,871 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,886 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,899 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,955 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:44,956 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,974 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,985 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,000 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,024 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,053 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,098 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:45,099 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:24:45,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,135 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:45,136 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,177 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:45,177 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:45,205 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,205 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,211 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:45,212 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,252 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:45,252 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:24:45,278 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,287 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:45,288 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:45,289 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,327 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:45,328 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:24:45,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,362 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:45,363 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:24:45,363 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,403 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:45,403 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:24:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:45,454 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:45,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:45,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:24:45,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:45,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:24:45,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:24:45,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:24:45,524 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-02-25 15:24:46,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:46,993 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-02-25 15:24:46,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:24:46,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:24:46,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:47,001 INFO L225 Difference]: With dead ends: 1218 [2019-02-25 15:24:47,001 INFO L226 Difference]: Without dead ends: 1217 [2019-02-25 15:24:47,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:24:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-02-25 15:24:47,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-02-25 15:24:47,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-02-25 15:24:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-02-25 15:24:47,385 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-02-25 15:24:47,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:47,385 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-02-25 15:24:47,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:24:47,385 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-02-25 15:24:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:47,386 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:47,387 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:47,387 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:47,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:47,387 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-02-25 15:24:47,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:47,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:47,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:24:47,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:47,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:47,531 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:24:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:47,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:47,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:47,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:47,552 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-02-25 15:24:47,552 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:47,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:47,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:47,555 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:47,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:47,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:47,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:47,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:47,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:47,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:47,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:24:47,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:47,583 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:47,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,585 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:47,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,589 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:24:47,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,596 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:47,600 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,604 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:47,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:24:47,614 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,661 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,683 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,701 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,715 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,728 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,780 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:47,780 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,795 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,805 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,821 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,844 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,871 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,914 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:47,914 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:24:47,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:47,945 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:47,946 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,992 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:47,992 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:48,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,025 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:48,026 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:48,026 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:48,064 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:48,064 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-02-25 15:24:48,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,328 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:48,328 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:48,368 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:48,368 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-02-25 15:24:48,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-02-25 15:24:48,392 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:48,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:48,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:48,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:48,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:48,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:48,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:48,445 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-02-25 15:24:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:49,237 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-02-25 15:24:49,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:49,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:24:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:49,241 INFO L225 Difference]: With dead ends: 814 [2019-02-25 15:24:49,241 INFO L226 Difference]: Without dead ends: 811 [2019-02-25 15:24:49,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:49,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-02-25 15:24:49,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-02-25 15:24:49,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-02-25 15:24:49,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-02-25 15:24:49,555 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-02-25 15:24:49,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:49,555 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-02-25 15:24:49,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-02-25 15:24:49,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:49,557 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:49,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:49,557 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:49,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:49,557 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-02-25 15:24:49,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:49,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:49,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:49,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:49,819 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-02-25 15:24:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:49,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:49,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:49,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:49,834 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-02-25 15:24:49,835 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:49,835 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:49,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:49,836 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:49,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:49,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:49,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:49,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:49,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:49,851 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:24:49,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:49,870 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:49,870 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,880 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,892 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,908 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,926 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,949 INFO L467 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 21 treesize of output 24 [2019-02-25 15:24:49,951 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:49,954 INFO L467 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 26 treesize of output 40 [2019-02-25 15:24:49,957 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:49,960 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:49,968 INFO L467 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 32 treesize of output 71 [2019-02-25 15:24:49,968 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,992 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:50,011 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:50,026 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:50,038 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:50,049 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:50,079 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:50,080 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:24:50,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,133 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:24:50,133 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:50,160 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:50,160 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:24:50,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,192 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:50,193 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:24:50,193 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:50,219 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:50,220 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 15:24:50,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,350 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:50,351 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:24:50,351 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:50,377 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:50,378 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-25 15:24:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:50,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:50,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:50,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:24:50,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:50,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:24:50,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:24:50,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:50,458 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-02-25 15:24:51,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:51,330 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-02-25 15:24:51,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:51,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:24:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:51,333 INFO L225 Difference]: With dead ends: 812 [2019-02-25 15:24:51,334 INFO L226 Difference]: Without dead ends: 811 [2019-02-25 15:24:51,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:24:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-02-25 15:24:51,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-02-25 15:24:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-02-25 15:24:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-02-25 15:24:51,646 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-02-25 15:24:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:51,646 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-02-25 15:24:51,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:24:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-02-25 15:24:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:51,648 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:51,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:51,648 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:51,648 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-02-25 15:24:51,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:51,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:51,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:51,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:51,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:51,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:51,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:51,720 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:51,720 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-02-25 15:24:51,721 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:51,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:51,723 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:51,723 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:24:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:51,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:51,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:51,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:51,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:51,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:51,739 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:51,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:51,743 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:24:51,746 INFO L467 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 24 treesize of output 26 [2019-02-25 15:24:51,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,830 INFO L467 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 26 treesize of output 36 [2019-02-25 15:24:51,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,913 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:51,931 INFO L467 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 28 treesize of output 50 [2019-02-25 15:24:51,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,052 INFO L292 Elim1Store]: Index analysis took 119 ms [2019-02-25 15:24:52,052 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:24:52,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,196 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,196 INFO L292 Elim1Store]: Index analysis took 142 ms [2019-02-25 15:24:52,197 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:24:52,198 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,250 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,270 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,287 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,299 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,312 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,396 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:52,397 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,407 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,419 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,436 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,461 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,501 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:52,502 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:24:52,528 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,536 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:52,537 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:52,666 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:52,667 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:122 [2019-02-25 15:24:52,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:52,718 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:24:52,718 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:52,752 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:52,752 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-25 15:24:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:52,771 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:52,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:52,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:24:52,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:52,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:52,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:52,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:52,807 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-02-25 15:24:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:53,458 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-02-25 15:24:53,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:53,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:24:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:53,461 INFO L225 Difference]: With dead ends: 843 [2019-02-25 15:24:53,461 INFO L226 Difference]: Without dead ends: 842 [2019-02-25 15:24:53,461 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-02-25 15:24:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-02-25 15:24:53,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-02-25 15:24:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-02-25 15:24:53,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-02-25 15:24:53,795 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-02-25 15:24:53,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:53,796 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-02-25 15:24:53,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-02-25 15:24:53,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:24:53,797 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:53,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:24:53,797 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:53,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-02-25 15:24:53,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:53,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:53,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:53,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:53,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:53,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:24:53,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:53,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:53,865 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:24:53,865 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-02-25 15:24:53,866 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:53,866 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:53,867 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:53,867 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:24:53,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:53,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:53,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:53,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:24:53,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:53,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:53,883 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:24:53,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:53,936 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:24:53,937 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,950 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,964 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:53,978 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,003 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,030 INFO L467 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 21 treesize of output 24 [2019-02-25 15:24:54,032 INFO L467 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 24 treesize of output 30 [2019-02-25 15:24:54,033 INFO L467 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 26 treesize of output 40 [2019-02-25 15:24:54,035 INFO L467 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 28 treesize of output 54 [2019-02-25 15:24:54,038 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:24:54,045 INFO L467 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 32 treesize of output 71 [2019-02-25 15:24:54,046 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,362 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,381 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,396 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,407 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,418 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:54,449 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:54,449 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:24:54,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,552 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 15:24:54,553 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:54,651 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:24:54,651 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-02-25 15:24:54,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,756 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:54,793 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 91 [2019-02-25 15:24:54,796 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:24:55,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,074 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,075 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:55,076 INFO L467 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 60 treesize of output 82 [2019-02-25 15:24:55,077 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,224 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-02-25 15:24:55,225 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-02-25 15:24:55,389 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-02-25 15:24:55,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,397 INFO L467 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 76 treesize of output 82 [2019-02-25 15:24:55,397 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,520 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:55,521 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 76 [2019-02-25 15:24:55,521 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,639 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:55,639 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 74 [2019-02-25 15:24:55,640 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:55,752 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:55,752 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:24:55,753 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:55,843 INFO L301 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-02-25 15:24:55,844 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-02-25 15:24:55,997 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-02-25 15:24:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:24:56,001 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:56,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-02-25 15:24:56,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:56,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:56,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:56,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:56,087 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-02-25 15:24:56,273 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-02-25 15:24:56,493 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-02-25 15:24:59,032 WARN L181 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-02-25 15:24:59,716 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-02-25 15:24:59,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:59,991 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-02-25 15:24:59,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:24:59,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:24:59,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:59,994 INFO L225 Difference]: With dead ends: 896 [2019-02-25 15:24:59,995 INFO L226 Difference]: Without dead ends: 895 [2019-02-25 15:24:59,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:24:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-02-25 15:25:00,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-02-25 15:25:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-02-25 15:25:00,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-02-25 15:25:00,331 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-02-25 15:25:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:00,331 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-02-25 15:25:00,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-02-25 15:25:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:00,332 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:00,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:00,333 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:00,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:00,333 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-02-25 15:25:00,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:00,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:00,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:00,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:00,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:00,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:00,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:00,401 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:00,402 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-02-25 15:25:00,402 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:00,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:00,404 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:00,404 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:25:00,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:00,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:00,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:00,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:00,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:00,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:00,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:00,423 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:25:00,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:00,442 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:25:00,442 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,529 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,538 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,552 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,570 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,593 INFO L467 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 21 treesize of output 24 [2019-02-25 15:25:00,596 INFO L467 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 24 treesize of output 30 [2019-02-25 15:25:00,598 INFO L467 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 26 treesize of output 40 [2019-02-25 15:25:00,600 INFO L467 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 28 treesize of output 54 [2019-02-25 15:25:00,603 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:25:00,612 INFO L467 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 32 treesize of output 71 [2019-02-25 15:25:00,613 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,637 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,656 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,671 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,683 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,694 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,730 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:00,730 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:25:00,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,771 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:25:00,771 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,797 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:00,798 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:25:00,820 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,826 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:25:00,827 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,854 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:00,854 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-25 15:25:00,873 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,873 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,880 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:00,881 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:25:00,881 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,907 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:00,907 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:25:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:00,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:00,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:00,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:00,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:00,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:00,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:00,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:00,979 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-02-25 15:25:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:03,283 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-02-25 15:25:03,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:25:03,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:25:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:03,287 INFO L225 Difference]: With dead ends: 975 [2019-02-25 15:25:03,287 INFO L226 Difference]: Without dead ends: 973 [2019-02-25 15:25:03,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:25:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-02-25 15:25:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-02-25 15:25:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-02-25 15:25:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-02-25 15:25:03,666 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-02-25 15:25:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:03,666 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-02-25 15:25:03,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:03,667 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-02-25 15:25:03,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:03,668 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:03,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:03,669 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:03,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:03,669 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-02-25 15:25:03,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:03,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:03,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:03,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:03,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:25:03,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:03,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:03,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:03,740 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-02-25 15:25:03,741 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:03,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:03,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:03,743 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:25:03,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:03,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:03,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:03,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:03,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:03,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:03,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:25:03,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:03,768 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:25:03,770 INFO L467 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 24 treesize of output 26 [2019-02-25 15:25:03,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,778 INFO L467 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 26 treesize of output 36 [2019-02-25 15:25:03,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,785 INFO L467 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 28 treesize of output 50 [2019-02-25 15:25:03,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,794 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:25:03,802 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:25:03,803 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,832 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,850 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,866 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,878 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,890 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,959 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:25:03,959 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,965 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,974 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,989 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:04,017 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:04,018 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:25:04,054 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:04,061 INFO L467 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 66 [2019-02-25 15:25:04,062 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:04,143 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:25:04,144 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-02-25 15:25:04,220 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:04,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:04,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:04,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:04,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:04,224 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:04,225 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 82 [2019-02-25 15:25:04,226 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:04,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:04,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:04,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:04,292 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:04,293 INFO L467 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 45 [2019-02-25 15:25:04,293 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:04,329 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:25:04,329 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:84 [2019-02-25 15:25:04,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:04,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:04,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:04,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:25:04,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:04,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:25:04,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:25:04,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:25:04,440 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-02-25 15:25:04,879 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-02-25 15:25:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:05,790 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-02-25 15:25:05,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:05,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:25:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:05,793 INFO L225 Difference]: With dead ends: 985 [2019-02-25 15:25:05,793 INFO L226 Difference]: Without dead ends: 984 [2019-02-25 15:25:05,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-02-25 15:25:06,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-02-25 15:25:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-02-25 15:25:06,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-02-25 15:25:06,184 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-02-25 15:25:06,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:06,184 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-02-25 15:25:06,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:25:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-02-25 15:25:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:06,186 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:06,186 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:06,186 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:06,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:06,186 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-02-25 15:25:06,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:06,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:06,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:06,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:06,187 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:06,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:06,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:06,279 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:06,280 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-02-25 15:25:06,280 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:06,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:06,282 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:06,282 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:25:06,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:06,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:06,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:06,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:06,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:06,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:06,296 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:25:06,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:06,374 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:06,375 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,394 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,401 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,415 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,435 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,464 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,499 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:25:06,501 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:25:06,504 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:25:06,507 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:25:06,510 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:25:06,514 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:25:06,514 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,547 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,566 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,581 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,594 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,605 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,648 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:06,649 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:25:06,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,691 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:06,692 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,732 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:06,732 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:06,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,773 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:06,774 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,814 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:06,814 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:25:06,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,854 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:06,854 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:06,855 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,893 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:06,893 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:25:06,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,928 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,948 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:06,949 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:25:06,949 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,987 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:06,987 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:25:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:07,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:07,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:07,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:25:07,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:07,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:25:07,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:25:07,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:07,782 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-02-25 15:25:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:12,028 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-02-25 15:25:12,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:25:12,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:25:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:12,033 INFO L225 Difference]: With dead ends: 1024 [2019-02-25 15:25:12,033 INFO L226 Difference]: Without dead ends: 1023 [2019-02-25 15:25:12,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:25:12,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-02-25 15:25:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-02-25 15:25:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-02-25 15:25:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-02-25 15:25:12,402 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-02-25 15:25:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:12,402 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-02-25 15:25:12,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:25:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-02-25 15:25:12,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:12,403 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:12,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:12,404 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:12,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:12,404 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-02-25 15:25:12,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:12,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:12,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:12,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:12,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:12,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:12,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:12,562 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:12,562 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-02-25 15:25:12,563 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:12,563 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:12,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:12,564 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:25:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:12,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:12,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:12,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:12,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:12,573 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:12,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:25:12,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:12,582 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:25:12,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,585 INFO L467 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 24 treesize of output 30 [2019-02-25 15:25:12,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,590 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:25:12,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,595 INFO L467 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 28 treesize of output 54 [2019-02-25 15:25:12,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,600 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,602 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:25:12,606 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,611 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:25:12,611 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,650 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,673 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,690 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,705 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,718 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,769 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:12,770 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,784 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,793 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,810 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,831 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,858 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,901 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:12,902 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:25:12,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:12,946 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:12,946 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:12,987 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:12,988 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:13,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,031 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:13,032 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:13,072 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:13,072 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:25:13,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,110 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:13,111 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:13,112 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:13,152 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:13,152 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:25:13,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,193 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,194 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:13,195 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:25:13,195 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:13,388 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:13,389 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-02-25 15:25:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:13,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:13,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:13,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:25:13,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:13,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:25:13,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:25:13,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:25:13,487 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-02-25 15:25:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:14,710 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-02-25 15:25:14,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:25:14,711 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:25:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:14,715 INFO L225 Difference]: With dead ends: 1059 [2019-02-25 15:25:14,715 INFO L226 Difference]: Without dead ends: 1057 [2019-02-25 15:25:14,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:25:14,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-02-25 15:25:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-02-25 15:25:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-02-25 15:25:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-02-25 15:25:15,101 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-02-25 15:25:15,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:15,102 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-02-25 15:25:15,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:25:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-02-25 15:25:15,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:15,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:15,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:15,103 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:15,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-02-25 15:25:15,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:15,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:15,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:15,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:15,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:15,267 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:15,267 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-02-25 15:25:15,268 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:15,268 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:15,269 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:15,269 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:25:15,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:15,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:15,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:15,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:15,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:15,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:15,284 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:25:15,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:15,287 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:25:15,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,291 INFO L467 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 24 treesize of output 30 [2019-02-25 15:25:15,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,295 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:25:15,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,299 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,320 INFO L467 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 28 treesize of output 54 [2019-02-25 15:25:15,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,327 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:25:15,336 INFO L467 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 32 treesize of output 71 [2019-02-25 15:25:15,337 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,365 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,387 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,404 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,418 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,430 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,470 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:25:15,471 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,481 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,490 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,505 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,522 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,553 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:15,553 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-02-25 15:25:15,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,616 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:25:15,616 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,642 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:15,642 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:25:15,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,677 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:25:15,677 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,701 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:15,702 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-02-25 15:25:15,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,735 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:15,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:25:15,736 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,760 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:15,760 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:25:15,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,790 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,791 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:15,791 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 70 [2019-02-25 15:25:15,792 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,817 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:15,818 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-25 15:25:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:15,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:15,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:15,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:25:15,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:15,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:25:15,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:25:15,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:15,913 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-02-25 15:25:17,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:17,959 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-02-25 15:25:17,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:25:17,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:25:17,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:17,964 INFO L225 Difference]: With dead ends: 1044 [2019-02-25 15:25:17,964 INFO L226 Difference]: Without dead ends: 1042 [2019-02-25 15:25:17,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:25:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-02-25 15:25:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-02-25 15:25:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-02-25 15:25:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-02-25 15:25:18,382 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-02-25 15:25:18,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:18,383 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-02-25 15:25:18,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:25:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-02-25 15:25:18,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:18,384 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:18,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:18,384 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:18,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:18,385 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-02-25 15:25:18,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:18,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:18,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:18,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:18,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:18,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:18,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:18,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:25:18,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:25:18,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:18,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:18,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:25:18,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:25:18,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:25:18,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:25:18,494 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:25:18,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:18,522 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:18,522 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,535 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,546 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,561 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,583 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,611 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,646 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:25:18,648 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:25:18,651 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:25:18,654 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:25:18,657 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:25:18,660 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:25:18,661 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,693 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,712 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,728 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,740 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,752 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,795 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:18,795 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:25:18,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:18,879 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:18,879 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,048 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:19,048 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:19,086 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,086 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,087 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,088 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,092 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:19,092 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,132 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:19,133 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:25:19,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,170 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,177 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:19,177 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:19,178 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,217 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:19,218 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:25:19,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,251 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,258 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:19,259 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:19,259 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,296 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:19,297 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:45 [2019-02-25 15:25:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:19,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:19,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:19,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:25:19,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:19,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:25:19,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:25:19,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:19,399 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-02-25 15:25:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:20,632 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-02-25 15:25:20,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:25:20,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:25:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:20,636 INFO L225 Difference]: With dead ends: 1044 [2019-02-25 15:25:20,636 INFO L226 Difference]: Without dead ends: 1041 [2019-02-25 15:25:20,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:25:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-02-25 15:25:21,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-02-25 15:25:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-02-25 15:25:21,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-02-25 15:25:21,066 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-02-25 15:25:21,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:21,066 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-02-25 15:25:21,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:25:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-02-25 15:25:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:21,067 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:21,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:21,068 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:21,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:21,068 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-02-25 15:25:21,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:21,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:21,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:25:21,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:21,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:21,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:21,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:21,139 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:21,139 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-02-25 15:25:21,140 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:21,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:21,142 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:21,142 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:25:21,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:21,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:21,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:21,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:21,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:21,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:21,155 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:25:21,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:21,158 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:25:21,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,162 INFO L467 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 24 treesize of output 30 [2019-02-25 15:25:21,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,169 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:25:21,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,176 INFO L467 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 28 treesize of output 54 [2019-02-25 15:25:21,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,183 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:25:21,194 INFO L467 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 32 treesize of output 71 [2019-02-25 15:25:21,195 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,221 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,243 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,260 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,274 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,286 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,326 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:25:21,327 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,336 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,343 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,352 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,369 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,400 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:21,400 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:25:21,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,505 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 15:25:21,506 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:21,602 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:25:21,602 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-02-25 15:25:21,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,738 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:21,746 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 79 [2019-02-25 15:25:21,747 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:21,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,871 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:21,872 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:21,872 INFO L467 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 60 treesize of output 66 [2019-02-25 15:25:21,873 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,950 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-02-25 15:25:21,951 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-02-25 15:25:22,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,061 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,062 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,067 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 77 [2019-02-25 15:25:22,068 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:22,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,165 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 74 [2019-02-25 15:25:22,165 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:22,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,267 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 83 [2019-02-25 15:25:22,268 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:22,396 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-02-25 15:25:22,397 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-02-25 15:25:22,529 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,529 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,530 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,531 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,537 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,539 INFO L467 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 46 treesize of output 74 [2019-02-25 15:25:22,539 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:22,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,653 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,657 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,658 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,659 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:22,660 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:25:22,661 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:22,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,756 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,764 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:22,765 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 72 [2019-02-25 15:25:22,766 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:22,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,871 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,872 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,873 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:22,883 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:22,897 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 93 [2019-02-25 15:25:22,899 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-02-25 15:25:23,099 INFO L301 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-25 15:25:23,099 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:236 [2019-02-25 15:25:23,322 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-02-25 15:25:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:23,325 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:23,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:23,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:25:23,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:23,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:25:23,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:25:23,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:23,437 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-02-25 15:25:23,624 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-02-25 15:25:23,879 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-02-25 15:25:24,273 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-02-25 15:25:24,762 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 76 [2019-02-25 15:25:26,761 WARN L181 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 113 DAG size of output: 88 [2019-02-25 15:25:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:28,535 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-02-25 15:25:28,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:25:28,536 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:25:28,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:28,539 INFO L225 Difference]: With dead ends: 1104 [2019-02-25 15:25:28,539 INFO L226 Difference]: Without dead ends: 1102 [2019-02-25 15:25:28,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:25:28,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-02-25 15:25:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-02-25 15:25:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-02-25 15:25:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-02-25 15:25:28,955 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-02-25 15:25:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:28,956 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-02-25 15:25:28,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:25:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-02-25 15:25:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:28,957 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:28,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:28,957 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:28,958 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-02-25 15:25:28,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:28,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:28,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:28,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:28,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:29,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:29,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:29,046 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:29,046 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-02-25 15:25:29,047 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:29,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:29,048 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:29,048 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:25:29,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:29,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:29,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:29,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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:29,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:29,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:29,064 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:25:29,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:29,100 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:25:29,100 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,114 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,132 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,152 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,177 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,206 INFO L467 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 21 treesize of output 24 [2019-02-25 15:25:29,209 INFO L467 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 24 treesize of output 30 [2019-02-25 15:25:29,211 INFO L467 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 26 treesize of output 40 [2019-02-25 15:25:29,214 INFO L467 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 28 treesize of output 54 [2019-02-25 15:25:29,217 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:25:29,225 INFO L467 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 32 treesize of output 71 [2019-02-25 15:25:29,226 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,252 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,271 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,286 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,298 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,310 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,341 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:29,341 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:25:29,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,395 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:25:29,396 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,421 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:29,422 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:25:29,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,450 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:29,451 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:25:29,451 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,498 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:29,499 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-02-25 15:25:29,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,526 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,527 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,528 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,529 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,530 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:25:29,530 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,556 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:29,556 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-25 15:25:29,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,586 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:29,587 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:25:29,587 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,614 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:29,614 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:36 [2019-02-25 15:25:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:29,636 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:29,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:29,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:25:29,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:29,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:25:29,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:25:29,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:25:29,700 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-02-25 15:25:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:32,097 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-02-25 15:25:32,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:25:32,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:25:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:32,103 INFO L225 Difference]: With dead ends: 1313 [2019-02-25 15:25:32,103 INFO L226 Difference]: Without dead ends: 1312 [2019-02-25 15:25:32,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:25:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-02-25 15:25:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-02-25 15:25:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-02-25 15:25:32,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-02-25 15:25:32,507 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-02-25 15:25:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:32,507 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-02-25 15:25:32,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:25:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-02-25 15:25:32,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:32,509 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:32,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:32,509 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:32,509 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-02-25 15:25:32,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:32,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:32,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:32,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:32,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:32,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:32,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:32,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:32,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:32,567 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-02-25 15:25:32,568 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:32,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:32,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:32,571 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:25:32,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:32,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:32,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:32,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:32,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:32,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:32,609 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:25:32,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:32,627 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:25:32,695 INFO L467 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 24 treesize of output 26 [2019-02-25 15:25:32,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,783 INFO L467 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 26 treesize of output 36 [2019-02-25 15:25:32,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,831 INFO L467 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 28 treesize of output 50 [2019-02-25 15:25:32,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,839 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:25:32,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,848 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:25:32,849 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,885 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,905 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,921 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,934 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,947 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,994 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:25:32,995 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:33,007 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:33,018 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:33,035 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:33,060 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:33,101 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:33,102 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:25:33,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,134 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:25:33,135 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:33,173 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:33,173 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 15:25:33,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,203 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,205 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,210 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:25:33,211 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:33,248 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:33,249 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-02-25 15:25:33,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,331 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:33,340 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:33,340 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:25:33,341 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:33,379 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:33,379 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-25 15:25:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:35,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:35,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:35,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:35,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:35,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:35,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:35,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:35,333 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-02-25 15:25:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:36,251 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-02-25 15:25:36,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:36,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:25:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:36,256 INFO L225 Difference]: With dead ends: 881 [2019-02-25 15:25:36,256 INFO L226 Difference]: Without dead ends: 880 [2019-02-25 15:25:36,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-02-25 15:25:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-02-25 15:25:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-02-25 15:25:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-02-25 15:25:36,664 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-02-25 15:25:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:36,664 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-02-25 15:25:36,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-02-25 15:25:36,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:36,666 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:36,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:36,666 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:36,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:36,666 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-02-25 15:25:36,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:36,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:36,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:36,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:36,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:36,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:36,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:36,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:36,788 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-02-25 15:25:36,789 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:36,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:36,792 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:36,792 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:25:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:36,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:36,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:36,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:36,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:36,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:36,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:25:36,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:36,813 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:25:36,816 INFO L467 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 24 treesize of output 26 [2019-02-25 15:25:36,820 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:36,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:36,823 INFO L467 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 26 treesize of output 36 [2019-02-25 15:25:36,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:36,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:36,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:36,829 INFO L467 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 28 treesize of output 50 [2019-02-25 15:25:36,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:36,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:36,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:36,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:36,838 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:25:36,850 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:25:36,851 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:36,899 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:36,920 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:36,935 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:36,948 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:36,960 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:36,997 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:25:36,997 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:37,004 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:37,016 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:37,032 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:37,061 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:37,061 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:25:37,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,099 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:25:37,099 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:37,124 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:37,124 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:25:37,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,158 INFO L467 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 66 [2019-02-25 15:25:37,159 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:37,233 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:25:37,233 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:68 [2019-02-25 15:25:37,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:37,274 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:37,274 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 47 [2019-02-25 15:25:37,275 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:37,291 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:37,291 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-02-25 15:25:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:37,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:37,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:37,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:25:37,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:37,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:37,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:37,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:25:37,349 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-02-25 15:25:38,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:38,551 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-02-25 15:25:38,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:25:38,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:25:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:38,556 INFO L225 Difference]: With dead ends: 1415 [2019-02-25 15:25:38,557 INFO L226 Difference]: Without dead ends: 1413 [2019-02-25 15:25:38,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:38,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-02-25 15:25:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-02-25 15:25:39,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-02-25 15:25:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-02-25 15:25:39,265 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-02-25 15:25:39,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:39,265 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-02-25 15:25:39,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:39,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-02-25 15:25:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:39,267 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:39,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:39,268 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:39,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:39,268 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-02-25 15:25:39,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:39,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:39,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:39,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:39,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:39,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:39,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:39,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:39,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:39,338 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-02-25 15:25:39,339 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:39,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:39,340 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:39,340 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:25:39,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:39,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:39,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:39,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:39,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:39,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:39,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:25:39,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:39,372 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:25:39,372 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,380 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,391 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,408 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,429 INFO L467 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 21 treesize of output 24 [2019-02-25 15:25:39,433 INFO L467 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 24 treesize of output 26 [2019-02-25 15:25:39,435 INFO L467 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 26 treesize of output 36 [2019-02-25 15:25:39,438 INFO L467 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 28 treesize of output 50 [2019-02-25 15:25:39,442 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:25:39,452 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:25:39,453 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,477 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,495 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,508 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,520 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,531 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,560 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:39,560 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:25:39,745 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-02-25 15:25:39,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,796 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:25:39,802 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-25 15:25:40,182 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-02-25 15:25:40,182 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:361 [2019-02-25 15:25:40,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,297 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:40,305 INFO L467 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 58 treesize of output 80 [2019-02-25 15:25:40,306 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:40,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,457 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,460 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,461 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 49 [2019-02-25 15:25:40,461 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:40,558 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,559 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,560 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,563 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:40,571 INFO L467 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 58 treesize of output 80 [2019-02-25 15:25:40,572 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:40,716 INFO L301 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-02-25 15:25:40,716 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:166, output treesize:184 [2019-02-25 15:25:40,852 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2019-02-25 15:25:40,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,880 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 51 [2019-02-25 15:25:40,880 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:40,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:40,942 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 49 [2019-02-25 15:25:40,942 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,007 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:41,007 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-02-25 15:25:41,008 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,051 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:25:41,052 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-02-25 15:25:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:43,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:43,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:43,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:43,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:43,217 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:43,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:43,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:43,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=112, Unknown=1, NotChecked=0, Total=182 [2019-02-25 15:25:43,218 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-02-25 15:25:43,586 WARN L181 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-02-25 15:25:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:53,011 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-02-25 15:25:53,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:25:53,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:25:53,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:53,016 INFO L225 Difference]: With dead ends: 1381 [2019-02-25 15:25:53,016 INFO L226 Difference]: Without dead ends: 1379 [2019-02-25 15:25:53,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=107, Invalid=198, Unknown=1, NotChecked=0, Total=306 [2019-02-25 15:25:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-02-25 15:25:53,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-02-25 15:25:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-02-25 15:25:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-02-25 15:25:53,703 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-02-25 15:25:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:53,703 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-02-25 15:25:53,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-02-25 15:25:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:53,705 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:53,705 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:53,705 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:53,706 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-02-25 15:25:53,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:53,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:53,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:53,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:53,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:53,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:25:53,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:53,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:53,753 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:53,753 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-02-25 15:25:53,754 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:53,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:53,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:53,756 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:25:53,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:53,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:53,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:53,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:53,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:53,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:53,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:25:53,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:53,796 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:25:53,796 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:53,809 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:53,826 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:53,846 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:53,872 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:53,905 INFO L467 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 21 treesize of output 24 [2019-02-25 15:25:53,908 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:25:53,912 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:25:53,915 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:25:53,919 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:25:53,922 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:25:53,922 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:53,955 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:53,973 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:53,987 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:53,998 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:54,009 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:54,050 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:54,051 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:25:54,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:54,074 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:25:54,074 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:54,114 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:54,114 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:25:54,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:54,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:54,138 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:54,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:54,140 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:54,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:54,143 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:54,151 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:54,152 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:54,305 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-25 15:25:54,306 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:114 [2019-02-25 15:25:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:54,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:54,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:54,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:25:54,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:54,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:25:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:25:54,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:25:54,410 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-02-25 15:25:55,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:55,492 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-02-25 15:25:55,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:25:55,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:25:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:55,497 INFO L225 Difference]: With dead ends: 1306 [2019-02-25 15:25:55,497 INFO L226 Difference]: Without dead ends: 1305 [2019-02-25 15:25:55,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:25:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-02-25 15:25:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-02-25 15:25:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-02-25 15:25:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-02-25 15:25:56,203 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-02-25 15:25:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:56,204 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-02-25 15:25:56,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:25:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-02-25 15:25:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:56,206 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:56,206 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:56,206 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:56,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:56,206 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-02-25 15:25:56,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:56,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:56,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:56,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:56,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:56,385 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-02-25 15:25:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:56,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:56,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:56,436 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:56,437 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-02-25 15:25:56,438 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:56,438 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:56,444 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:56,444 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:25:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:56,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:56,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:56,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:56,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:56,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:56,465 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:25:56,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:56,492 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:56,493 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,507 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,517 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,535 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,555 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,583 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,617 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:25:56,620 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:25:56,623 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:25:56,626 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:25:56,629 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:25:56,632 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:25:56,632 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,665 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,685 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,700 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,713 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,724 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,767 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:56,768 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:25:56,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,811 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:56,811 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,850 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:56,850 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:56,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,892 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:56,893 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:56,894 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,935 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:56,936 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:61 [2019-02-25 15:25:56,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,973 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:25:56,974 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,014 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:57,014 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-02-25 15:25:57,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,054 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,055 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,057 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,061 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:57,061 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:25:57,062 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,101 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:57,102 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:25:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:57,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:25:57,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:57,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:25:57,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:57,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:25:57,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:25:57,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:57,209 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-02-25 15:25:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:58,906 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-02-25 15:25:58,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:25:58,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:25:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:58,912 INFO L225 Difference]: With dead ends: 1360 [2019-02-25 15:25:58,912 INFO L226 Difference]: Without dead ends: 1358 [2019-02-25 15:25:58,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:25:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-02-25 15:25:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-02-25 15:25:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-02-25 15:25:59,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-02-25 15:25:59,620 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-02-25 15:25:59,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:59,620 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-02-25 15:25:59,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:25:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-02-25 15:25:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:59,622 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:59,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:59,623 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:59,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:59,623 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-02-25 15:25:59,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:59,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:59,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:59,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:59,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:59,835 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-02-25 15:25:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:25:59,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:59,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:59,872 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:25:59,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:25:59,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:59,872 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:25:59,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:25:59,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:25:59,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:25:59,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:25:59,889 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:25:59,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:59,920 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:59,920 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:59,936 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:59,947 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:59,966 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:59,988 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,017 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,051 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:26:00,054 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:26:00,057 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:26:00,060 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:26:00,063 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:26:00,067 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:26:00,067 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,101 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,121 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,136 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,149 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,160 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,204 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:00,205 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:26:00,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,233 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:00,233 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,276 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:00,276 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:00,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,307 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:00,308 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,349 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:00,350 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:26:00,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,381 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:00,382 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:00,383 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,423 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:00,423 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:26:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:00,445 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:00,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:00,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:26:00,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:00,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:26:00,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:26:00,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:26:00,494 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-02-25 15:26:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:02,189 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-02-25 15:26:02,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:26:02,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:26:02,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:02,195 INFO L225 Difference]: With dead ends: 1898 [2019-02-25 15:26:02,195 INFO L226 Difference]: Without dead ends: 1896 [2019-02-25 15:26:02,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:26:02,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-02-25 15:26:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-02-25 15:26:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-02-25 15:26:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-02-25 15:26:03,219 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-02-25 15:26:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:03,219 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-02-25 15:26:03,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:26:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-02-25 15:26:03,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:03,223 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:03,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:03,224 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-02-25 15:26:03,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:03,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:03,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:26:03,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:03,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:03,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:26:03,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:26:03,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:26:03,309 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:26:03,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:26:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:26:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:26:03,309 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-02-25 15:26:04,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:04,340 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-02-25 15:26:04,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:26:04,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-02-25 15:26:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:04,345 INFO L225 Difference]: With dead ends: 1693 [2019-02-25 15:26:04,345 INFO L226 Difference]: Without dead ends: 1692 [2019-02-25 15:26:04,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:26:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-02-25 15:26:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-02-25 15:26:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-02-25 15:26:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-02-25 15:26:05,396 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-02-25 15:26:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:05,396 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-02-25 15:26:05,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:26:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-02-25 15:26:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:05,399 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:05,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:05,399 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:05,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:05,399 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-02-25 15:26:05,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:05,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:05,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:05,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:05,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:05,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:05,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:05,443 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:05,444 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-02-25 15:26:05,444 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:05,445 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:05,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:05,446 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:26:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:05,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:05,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:05,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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:05,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:05,455 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:05,460 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:26:05,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:05,463 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:26:05,469 INFO L467 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 24 treesize of output 26 [2019-02-25 15:26:05,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,478 INFO L467 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 26 treesize of output 36 [2019-02-25 15:26:05,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,486 INFO L467 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 28 treesize of output 50 [2019-02-25 15:26:05,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,493 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,498 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,498 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:26:05,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,503 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,504 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,505 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,506 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:26:05,506 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,544 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,564 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,580 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,596 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,609 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,656 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:26:05,657 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,667 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,679 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,699 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,724 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,766 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:05,766 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-02-25 15:26:05,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,790 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:26:05,790 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,850 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:05,851 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:26:05,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,908 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,912 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:26:05,913 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,950 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:05,951 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:51 [2019-02-25 15:26:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:05,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:05,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:05,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:26:05,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:05,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:26:05,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:26:05,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:26:05,997 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-02-25 15:26:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:08,029 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-02-25 15:26:08,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:26:08,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:26:08,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:08,037 INFO L225 Difference]: With dead ends: 2759 [2019-02-25 15:26:08,037 INFO L226 Difference]: Without dead ends: 2757 [2019-02-25 15:26:08,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:26:08,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-02-25 15:26:09,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-02-25 15:26:09,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-02-25 15:26:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-02-25 15:26:09,777 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-02-25 15:26:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:09,777 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-02-25 15:26:09,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:26:09,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-02-25 15:26:09,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:09,781 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:09,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:09,781 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:09,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:09,781 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-02-25 15:26:09,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:09,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:09,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:09,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:09,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:09,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:09,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:09,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:09,906 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:09,906 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-02-25 15:26:09,907 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:09,907 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:09,909 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:09,909 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:26:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:09,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:09,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:09,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:09,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:09,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:09,923 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:26:09,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:09,927 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:26:09,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,930 INFO L467 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 24 treesize of output 30 [2019-02-25 15:26:09,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,935 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:26:09,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,993 INFO L467 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 28 treesize of output 54 [2019-02-25 15:26:09,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,001 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:26:10,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:26:10,010 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,049 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,071 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,089 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,103 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,114 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,168 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:10,168 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,183 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,199 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,220 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,243 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,271 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,314 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:10,315 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:26:10,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,349 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:10,350 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,388 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:10,389 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:10,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,423 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:10,424 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:10,424 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,462 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:10,462 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-02-25 15:26:10,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,491 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,493 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,494 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,496 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,500 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:10,501 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,540 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:10,540 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-02-25 15:26:10,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,580 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:10,581 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:10,581 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,620 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:10,620 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:45 [2019-02-25 15:26:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:10,643 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:10,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:10,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:26:10,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:10,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:26:10,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:26:10,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:26:10,709 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-02-25 15:26:14,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:14,171 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-02-25 15:26:14,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:26:14,171 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:26:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:14,183 INFO L225 Difference]: With dead ends: 3636 [2019-02-25 15:26:14,183 INFO L226 Difference]: Without dead ends: 3626 [2019-02-25 15:26:14,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:26:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-02-25 15:26:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-02-25 15:26:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-02-25 15:26:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-02-25 15:26:16,742 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-02-25 15:26:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:16,742 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-02-25 15:26:16,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:26:16,742 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-02-25 15:26:16,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:16,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:16,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:16,746 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:16,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:16,747 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-02-25 15:26:16,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:16,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:16,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:17,091 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-02-25 15:26:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:17,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:17,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:17,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:26:17,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:26:17,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:17,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:17,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:26:17,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:26:17,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:26:17,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:26:17,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:26:17,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:17,195 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:26:17,200 INFO L467 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 24 treesize of output 26 [2019-02-25 15:26:17,203 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,204 INFO L467 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 26 treesize of output 36 [2019-02-25 15:26:17,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,212 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,213 INFO L467 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 28 treesize of output 50 [2019-02-25 15:26:17,216 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,221 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:26:17,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,230 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:26:17,231 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,269 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,290 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,306 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,319 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,332 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,378 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:26:17,378 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,391 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,419 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,438 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,464 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,506 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:17,507 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:26:17,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:26:17,534 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,574 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:17,574 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:26:17,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,600 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:17,611 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:17,612 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:26:17,790 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:26:17,790 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:98 [2019-02-25 15:26:18,273 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2019-02-25 15:26:18,277 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,278 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,278 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,282 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:18,282 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:26:18,283 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:18,313 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:18,313 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:36 [2019-02-25 15:26:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:18,329 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:18,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:18,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:26:18,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:18,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:26:18,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:26:18,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:26:18,373 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-02-25 15:26:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:22,365 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-02-25 15:26:22,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:26:22,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:26:22,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:22,378 INFO L225 Difference]: With dead ends: 4300 [2019-02-25 15:26:22,378 INFO L226 Difference]: Without dead ends: 4298 [2019-02-25 15:26:22,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:26:22,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-02-25 15:26:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-02-25 15:26:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-02-25 15:26:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-02-25 15:26:26,072 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-02-25 15:26:26,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:26,072 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-02-25 15:26:26,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:26:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-02-25 15:26:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:26:26,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:26,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:26:26,078 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:26,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-02-25 15:26:26,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:26,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:26,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:26:26,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:26,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:26:26,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:26,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:26,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:26:26,149 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-02-25 15:26:26,149 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:26,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:26,150 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:26,151 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:26:26,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:26,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:26,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:26,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:26,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:26,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:26,165 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:26:26,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:26,168 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:26:26,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,172 INFO L467 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 24 treesize of output 30 [2019-02-25 15:26:26,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,176 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:26:26,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,182 INFO L467 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 28 treesize of output 54 [2019-02-25 15:26:26,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,190 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:26:26,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,196 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,199 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:26:26,200 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,239 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,261 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,279 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,294 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,307 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,357 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:26,358 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,373 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,379 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,395 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,415 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,442 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,486 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:26,486 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:26:26,564 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,565 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:26,565 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,606 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:26,606 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:26,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,641 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:26,646 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:26,646 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,050 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:27,050 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-25 15:26:27,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,107 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:27,107 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:27,108 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,148 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:27,148 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:26:27,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,190 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:27,191 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:27,191 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,231 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:27,232 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:45 [2019-02-25 15:26:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:27,260 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:27,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:27,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:26:27,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:27,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:26:27,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:26:27,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:26:27,337 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-02-25 15:26:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:31,653 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-02-25 15:26:31,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:26:31,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:26:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:31,667 INFO L225 Difference]: With dead ends: 4236 [2019-02-25 15:26:31,667 INFO L226 Difference]: Without dead ends: 4233 [2019-02-25 15:26:31,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:26:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-02-25 15:26:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-02-25 15:26:35,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-02-25 15:26:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-02-25 15:26:35,406 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-02-25 15:26:35,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:35,406 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-02-25 15:26:35,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:26:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-02-25 15:26:35,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:26:35,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:35,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:26:35,412 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:35,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-02-25 15:26:35,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:35,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:35,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:35,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:35,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:26:35,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:35,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:35,507 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:26:35,508 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-02-25 15:26:35,508 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:35,509 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:35,510 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:35,511 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:26:35,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:35,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:35,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:35,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:35,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:35,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:35,526 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:26:35,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:35,547 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:26:35,547 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,557 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,567 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,583 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,601 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,624 INFO L467 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 21 treesize of output 24 [2019-02-25 15:26:35,626 INFO L467 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 24 treesize of output 30 [2019-02-25 15:26:35,629 INFO L467 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 26 treesize of output 40 [2019-02-25 15:26:35,639 INFO L467 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 28 treesize of output 54 [2019-02-25 15:26:35,642 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:26:35,649 INFO L467 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 32 treesize of output 71 [2019-02-25 15:26:35,650 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,674 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,694 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,709 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,721 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,733 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,764 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:35,764 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-02-25 15:26:35,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,829 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:26:35,829 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,856 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:35,856 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:26:35,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,891 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:26:35,891 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,916 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:35,917 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 15:26:35,946 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,954 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:35,954 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:26:35,955 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,981 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:35,982 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:26:36,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:36,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:36,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:36,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:36,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:36,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:36,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:36,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:36,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:36,014 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:36,015 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:26:36,015 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:36,039 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:36,040 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-25 15:26:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:36,089 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:36,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:36,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:36,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:26:36,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:36,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:26:36,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:26:36,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:26:36,165 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-02-25 15:26:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:40,290 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-02-25 15:26:40,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:26:40,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:26:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:40,302 INFO L225 Difference]: With dead ends: 4232 [2019-02-25 15:26:40,302 INFO L226 Difference]: Without dead ends: 4231 [2019-02-25 15:26:40,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:26:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-02-25 15:26:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-02-25 15:26:44,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-02-25 15:26:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-02-25 15:26:44,084 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-02-25 15:26:44,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:44,084 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-02-25 15:26:44,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:26:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-02-25 15:26:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:26:44,089 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:44,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:26:44,090 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:44,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:44,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-02-25 15:26:44,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:44,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:44,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:44,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:44,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:44,264 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:26:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:26:44,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:44,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:44,353 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:26:44,354 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-02-25 15:26:44,354 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:44,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:44,356 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:44,357 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:26:44,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:44,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:44,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:44,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:44,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:44,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:44,370 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:26:44,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:44,409 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:26:44,409 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,425 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,444 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,471 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,502 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,538 INFO L467 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 21 treesize of output 24 [2019-02-25 15:26:44,542 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:26:44,547 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:26:44,550 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:26:44,554 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:26:44,559 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:26:44,559 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,590 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,608 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,622 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,633 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,644 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,685 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:44,685 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:26:44,718 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,719 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:26:44,720 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,759 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:44,759 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 15:26:44,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,810 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:44,810 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:26:44,935 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:26:44,935 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:110 [2019-02-25 15:26:44,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,991 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:44,994 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:44,994 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:26:44,995 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,024 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:45,025 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:36 [2019-02-25 15:26:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:45,932 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:45,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:45,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:26:45,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:45,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:26:45,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:26:45,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:26:45,983 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-02-25 15:26:46,214 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-25 15:26:50,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:50,346 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-02-25 15:26:50,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:26:50,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:26:50,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:50,360 INFO L225 Difference]: With dead ends: 4570 [2019-02-25 15:26:50,360 INFO L226 Difference]: Without dead ends: 4569 [2019-02-25 15:26:50,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:26:50,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-02-25 15:26:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-02-25 15:26:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-02-25 15:26:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-02-25 15:26:54,410 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-02-25 15:26:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:54,411 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-02-25 15:26:54,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:26:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-02-25 15:26:54,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:26:54,418 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:54,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:26:54,418 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:54,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-02-25 15:26:54,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:54,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:54,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:54,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:54,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:26:54,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:54,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:54,628 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:26:54,628 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-02-25 15:26:54,629 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:54,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:54,631 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:54,631 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:26:54,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:54,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:54,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:54,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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:26:54,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:54,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:54,647 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:26:54,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:54,651 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:26:54,653 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,654 INFO L467 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 24 treesize of output 30 [2019-02-25 15:26:54,657 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,658 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,658 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:26:54,662 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,666 INFO L467 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 28 treesize of output 54 [2019-02-25 15:26:54,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,675 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:26:54,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,684 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:26:54,684 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,724 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,745 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,763 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,777 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,790 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,843 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:54,843 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,858 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,872 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,890 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,915 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,942 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:54,986 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:54,986 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:26:55,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,028 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:55,029 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,070 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:55,071 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:55,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,112 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:55,113 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,154 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:55,154 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-25 15:26:55,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,193 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,193 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:55,194 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:55,195 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,233 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:55,233 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:26:55,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,263 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,275 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:55,276 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:26:55,276 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,315 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:55,315 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-02-25 15:26:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:55,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:55,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:55,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:26:55,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:55,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:26:55,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:26:55,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:26:55,453 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-02-25 15:27:01,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:01,306 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-02-25 15:27:01,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:27:01,306 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:27:01,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:01,325 INFO L225 Difference]: With dead ends: 5928 [2019-02-25 15:27:01,325 INFO L226 Difference]: Without dead ends: 5927 [2019-02-25 15:27:01,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:27:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-02-25 15:27:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-02-25 15:27:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-02-25 15:27:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-02-25 15:27:06,773 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-02-25 15:27:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:06,773 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-02-25 15:27:06,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:27:06,774 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-02-25 15:27:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:27:06,780 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:06,780 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:27:06,780 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:06,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:06,781 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-02-25 15:27:06,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:06,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:06,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:06,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:07,137 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-02-25 15:27:07,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:27:07,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:07,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:07,208 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:27:07,208 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-02-25 15:27:07,208 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:07,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:07,210 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:07,211 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:27:07,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:07,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:07,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:07,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:27:07,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:07,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:07,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:27:07,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:07,227 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:27:07,230 INFO L467 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 24 treesize of output 26 [2019-02-25 15:27:07,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,236 INFO L467 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 26 treesize of output 36 [2019-02-25 15:27:07,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,241 INFO L467 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 28 treesize of output 50 [2019-02-25 15:27:07,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,249 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:27:07,264 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:27:07,264 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:07,289 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:07,309 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:07,325 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:07,337 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:07,349 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:07,385 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:27:07,385 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:07,393 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:07,403 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:07,419 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:07,447 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:07,448 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-25 15:27:07,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,496 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:27:07,496 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:07,521 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:07,521 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-25 15:27:07,718 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-02-25 15:27:07,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:07,912 INFO L292 Elim1Store]: Index analysis took 191 ms [2019-02-25 15:27:07,967 INFO L467 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 68 [2019-02-25 15:27:07,968 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:27:08,043 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:27:08,044 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-02-25 15:27:08,084 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,084 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,086 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,086 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,087 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,088 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,090 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:08,090 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 76 [2019-02-25 15:27:08,091 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:08,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,144 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:08,146 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:08,147 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 47 [2019-02-25 15:27:08,147 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:08,181 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:27:08,181 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:72 [2019-02-25 15:27:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:08,237 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:08,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:08,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:27:08,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:08,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:27:08,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:27:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:27:08,288 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-02-25 15:27:15,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:15,065 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-02-25 15:27:15,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:27:15,065 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:27:15,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:15,090 INFO L225 Difference]: With dead ends: 6511 [2019-02-25 15:27:15,090 INFO L226 Difference]: Without dead ends: 6510 [2019-02-25 15:27:15,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:27:15,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-02-25 15:27:22,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-02-25 15:27:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-02-25 15:27:22,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-02-25 15:27:22,035 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-02-25 15:27:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:22,035 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-02-25 15:27:22,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:27:22,036 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-02-25 15:27:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:27:22,043 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:22,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:27:22,043 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:22,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:22,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-02-25 15:27:22,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:22,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:22,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:22,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:22,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:22,271 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-02-25 15:27:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:22,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:22,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:22,454 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:27:22,454 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-02-25 15:27:22,455 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:22,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:22,457 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:22,457 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:27:22,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:22,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:22,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:22,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:27:22,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:22,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:22,473 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:27:22,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:22,497 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:27:22,497 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,510 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,522 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,539 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,565 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,598 INFO L467 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 21 treesize of output 24 [2019-02-25 15:27:22,601 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:27:22,604 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:27:22,608 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:27:22,612 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:27:22,616 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:27:22,616 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,648 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,666 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,680 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,691 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,702 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,743 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:22,743 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-02-25 15:27:22,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,815 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:27:22,816 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,841 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:22,841 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:27:22,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,881 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:27:22,881 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,907 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:22,907 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 15:27:22,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,942 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:22,943 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:27:22,943 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,968 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:22,968 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:27:22,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:22,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,005 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:23,006 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 70 [2019-02-25 15:27:23,006 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,031 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:23,031 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-25 15:27:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:23,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:23,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:23,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:23,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-25 15:27:23,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:23,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:27:23,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:27:23,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:27:23,149 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-02-25 15:27:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:31,779 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-02-25 15:27:31,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:27:31,779 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-25 15:27:31,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:31,802 INFO L225 Difference]: With dead ends: 7179 [2019-02-25 15:27:31,802 INFO L226 Difference]: Without dead ends: 7170 [2019-02-25 15:27:31,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:27:31,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-02-25 15:27:38,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-02-25 15:27:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-02-25 15:27:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-02-25 15:27:38,750 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-02-25 15:27:38,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:38,750 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-02-25 15:27:38,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:27:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-02-25 15:27:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:27:38,757 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:38,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:27:38,757 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:38,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:38,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-02-25 15:27:38,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:38,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:38,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:38,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:38,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:38,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:38,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:38,793 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:27:38,793 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-02-25 15:27:38,794 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:38,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:38,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:38,795 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:27:38,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:38,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:38,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:38,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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:27:38,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:38,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:38,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:27:38,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:38,828 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:27:38,828 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:38,838 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:38,854 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:38,875 INFO L467 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 21 treesize of output 24 [2019-02-25 15:27:38,878 INFO L467 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 24 treesize of output 26 [2019-02-25 15:27:38,882 INFO L467 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 26 treesize of output 28 [2019-02-25 15:27:38,891 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:27:38,898 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-02-25 15:27:38,906 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:27:38,906 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:38,931 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:38,942 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:38,953 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:38,964 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:38,976 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:39,005 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:39,005 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-02-25 15:27:39,032 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:39,053 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 79 [2019-02-25 15:27:39,055 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:27:39,320 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-02-25 15:27:39,321 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:333 [2019-02-25 15:27:39,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:39,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:39,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:39,385 INFO L467 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 30 [2019-02-25 15:27:39,386 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:39,395 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:39,395 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-02-25 15:27:39,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:39,409 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:27:39,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:39,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:27:39,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:39,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:27:39,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:27:39,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:27:39,448 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-02-25 15:27:49,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:49,153 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-02-25 15:27:49,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:27:49,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:27:49,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:49,190 INFO L225 Difference]: With dead ends: 10441 [2019-02-25 15:27:49,190 INFO L226 Difference]: Without dead ends: 10440 [2019-02-25 15:27:49,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:27:49,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-02-25 15:27:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-02-25 15:27:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-02-25 15:27:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-02-25 15:27:59,804 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-02-25 15:27:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:59,804 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-02-25 15:27:59,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:27:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-02-25 15:27:59,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:27:59,814 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:59,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:27:59,814 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:59,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:59,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-02-25 15:27:59,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:59,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:59,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:59,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:28:00,014 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-02-25 15:28:00,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:28:00,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:00,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:28:00,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:28:00,050 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-02-25 15:28:00,050 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:28:00,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:28:00,052 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:28:00,052 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:28:00,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:28:00,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:28:00,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:00,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:28:00,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:28:00,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:28:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:28:00,069 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:28:00,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:28:00,073 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:28:00,076 INFO L467 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 24 treesize of output 26 [2019-02-25 15:28:00,082 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,083 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,084 INFO L467 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 26 treesize of output 36 [2019-02-25 15:28:00,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,092 INFO L467 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 28 treesize of output 50 [2019-02-25 15:28:00,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,100 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:28:00,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,111 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:28:00,111 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,147 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,167 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,184 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,197 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,209 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,255 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:28:00,256 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,268 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,277 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,294 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,319 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,360 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:00,360 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:28:00,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,393 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:28:00,394 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,432 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:00,433 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 15:28:00,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,460 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,462 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,464 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:00,465 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:28:00,465 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:00,503 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:00,503 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:57 [2019-02-25 15:28:00,529 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,530 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,531 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,537 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:00,539 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:00,547 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:28:00,548 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:28:00,666 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-25 15:28:00,666 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:106 [2019-02-25 15:28:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:02,725 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:28:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:02,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:28:02,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:28:02,784 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:28:02,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:28:02,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:28:02,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=114, Unknown=1, NotChecked=0, Total=182 [2019-02-25 15:28:02,784 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-02-25 15:28:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:28:12,756 INFO L93 Difference]: Finished difference Result 10427 states and 73743 transitions. [2019-02-25 15:28:12,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:28:12,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:28:12,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:28:12,793 INFO L225 Difference]: With dead ends: 10427 [2019-02-25 15:28:12,794 INFO L226 Difference]: Without dead ends: 10426 [2019-02-25 15:28:12,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=100, Invalid=171, Unknown=1, NotChecked=0, Total=272 [2019-02-25 15:28:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2019-02-25 15:28:23,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 10394. [2019-02-25 15:28:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10394 states. [2019-02-25 15:28:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 73688 transitions. [2019-02-25 15:28:23,457 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 73688 transitions. Word has length 7 [2019-02-25 15:28:23,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:28:23,457 INFO L480 AbstractCegarLoop]: Abstraction has 10394 states and 73688 transitions. [2019-02-25 15:28:23,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:28:23,457 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 73688 transitions. [2019-02-25 15:28:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:28:23,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:28:23,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:28:23,468 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:28:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:28:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-02-25 15:28:23,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:28:23,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:28:23,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:28:23,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:28:23,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:28:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:28:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:23,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:23,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:28:23,578 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:28:23,578 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [28], [29] [2019-02-25 15:28:23,579 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:28:23,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:28:23,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:28:23,580 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:28:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:28:23,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:28:23,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:23,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:28:23,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:28:23,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:28:23,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:28:23,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:28:23,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:28:23,599 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:28:23,603 INFO L467 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 24 treesize of output 26 [2019-02-25 15:28:23,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,609 INFO L467 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 26 treesize of output 36 [2019-02-25 15:28:23,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,618 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,618 INFO L467 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 28 treesize of output 50 [2019-02-25 15:28:23,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,623 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,626 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:28:23,637 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:28:23,638 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,662 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,682 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,697 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,710 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,722 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,758 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:28:23,758 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,767 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,777 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,793 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,821 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:23,822 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-25 15:28:23,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,867 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:28:23,867 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,884 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:23,884 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:28:23,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:23,981 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:23,982 INFO L467 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 47 [2019-02-25 15:28:23,982 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:23,997 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:23,997 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:31 [2019-02-25 15:28:24,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,023 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 49 [2019-02-25 15:28:24,023 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:24,040 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:24,040 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-25 15:28:24,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,061 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:24,066 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:24,067 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 49 [2019-02-25 15:28:24,067 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:24,084 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:24,084 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-25 15:28:24,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:24,102 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:28:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:24,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:28:24,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:28:24,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:28:24,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:28:24,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:28:24,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:28:24,182 INFO L87 Difference]: Start difference. First operand 10394 states and 73688 transitions. Second operand 12 states. [2019-02-25 15:28:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:28:34,976 INFO L93 Difference]: Finished difference Result 11408 states and 80747 transitions. [2019-02-25 15:28:34,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:28:34,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:28:34,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:28:35,015 INFO L225 Difference]: With dead ends: 11408 [2019-02-25 15:28:35,015 INFO L226 Difference]: Without dead ends: 11406 [2019-02-25 15:28:35,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:28:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-02-25 15:28:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 11270. [2019-02-25 15:28:46,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-02-25 15:28:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 80138 transitions. [2019-02-25 15:28:46,288 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 80138 transitions. Word has length 7 [2019-02-25 15:28:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:28:46,288 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 80138 transitions. [2019-02-25 15:28:46,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:28:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 80138 transitions. [2019-02-25 15:28:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:28:46,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:28:46,299 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-25 15:28:46,300 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:28:46,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:28:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-02-25 15:28:46,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:28:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:28:46,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:28:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:28:46,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:28:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:28:46,475 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:28:46,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:46,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:28:46,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:28:46,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:28:46,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:28:46,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:28:46,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:28:46,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:28:46,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:28:46,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:28:46,507 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:28:46,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:28:46,511 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:28:46,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,514 INFO L467 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 24 treesize of output 30 [2019-02-25 15:28:46,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,519 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:28:46,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,526 INFO L467 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 28 treesize of output 54 [2019-02-25 15:28:46,530 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,535 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:28:46,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,543 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:28:46,544 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,583 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,605 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,623 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,637 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,650 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,701 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:28:46,701 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,717 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,730 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,751 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,774 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,801 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,844 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:46,845 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:28:46,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,880 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:28:46,880 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,922 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:46,922 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:28:46,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:46,959 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:28:46,959 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:46,999 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:46,999 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-25 15:28:47,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,032 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,037 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:47,038 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:28:47,038 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:47,077 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:47,078 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-02-25 15:28:47,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,114 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:28:47,114 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:28:47,115 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:47,154 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:47,154 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-02-25 15:28:47,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,193 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,196 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:28:47,200 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 93 [2019-02-25 15:28:47,201 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:28:47,239 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:28:47,240 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:41 [2019-02-25 15:28:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:47,266 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:28:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:28:47,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:28:47,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-25 15:28:47,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:28:47,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:28:47,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:28:47,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:28:47,356 INFO L87 Difference]: Start difference. First operand 11270 states and 80138 transitions. Second operand 13 states. [2019-02-25 15:29:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:29:01,698 INFO L93 Difference]: Finished difference Result 14692 states and 103813 transitions. [2019-02-25 15:29:01,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:29:01,699 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-25 15:29:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:29:01,750 INFO L225 Difference]: With dead ends: 14692 [2019-02-25 15:29:01,750 INFO L226 Difference]: Without dead ends: 14688 [2019-02-25 15:29:01,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:29:01,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-02-25 15:29:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12758. [2019-02-25 15:29:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-02-25 15:29:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 90546 transitions. [2019-02-25 15:29:15,030 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 90546 transitions. Word has length 7 [2019-02-25 15:29:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:29:15,031 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 90546 transitions. [2019-02-25 15:29:15,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:29:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 90546 transitions. [2019-02-25 15:29:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:29:15,042 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:29:15,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:29:15,042 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:29:15,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:29:15,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-02-25 15:29:15,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:29:15,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:29:15,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:29:15,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:29:15,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:29:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:29:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:29:15,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:29:15,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:29:15,083 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:29:15,083 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [28], [30], [31] [2019-02-25 15:29:15,084 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:29:15,084 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:29:15,085 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:29:15,086 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:29:15,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:29:15,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:29:15,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:29:15,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:29:15,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:29:15,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:29:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:29:15,100 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:29:15,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:29:15,104 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:29:15,154 INFO L467 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 24 treesize of output 26 [2019-02-25 15:29:15,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,250 INFO L467 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 26 treesize of output 36 [2019-02-25 15:29:15,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,352 INFO L467 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 28 treesize of output 50 [2019-02-25 15:29:15,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,460 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,477 INFO L292 Elim1Store]: Index analysis took 124 ms [2019-02-25 15:29:15,478 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:29:15,510 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:15,631 INFO L292 Elim1Store]: Index analysis took 152 ms [2019-02-25 15:29:15,632 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:29:15,632 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:15,818 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:15,839 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:15,855 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:15,868 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:15,881 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:15,929 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:29:15,930 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:15,939 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:15,950 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:15,969 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:15,994 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:16,035 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:16,036 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:29:16,062 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,063 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:29:16,064 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:16,100 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:16,101 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:29:16,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,127 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,132 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:29:16,133 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:16,170 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:16,171 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-25 15:29:16,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,196 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,203 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:16,205 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:29:16,206 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:29:16,206 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:16,243 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:16,243 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-25 15:29:16,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:29:16,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:29:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:29:16,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:29:16,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:29:16,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:29:16,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:29:16,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:29:16,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:29:16,340 INFO L87 Difference]: Start difference. First operand 12758 states and 90546 transitions. Second operand 10 states. [2019-02-25 15:29:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:29:28,828 INFO L93 Difference]: Finished difference Result 13016 states and 92075 transitions. [2019-02-25 15:29:28,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:29:28,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:29:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:29:28,874 INFO L225 Difference]: With dead ends: 13016 [2019-02-25 15:29:28,874 INFO L226 Difference]: Without dead ends: 13015 [2019-02-25 15:29:28,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:29:28,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2019-02-25 15:29:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 12958. [2019-02-25 15:29:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-02-25 15:29:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-02-25 15:29:42,343 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-02-25 15:29:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:29:42,343 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-02-25 15:29:42,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:29:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-02-25 15:29:42,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:29:42,356 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:29:42,356 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-25 15:29:42,356 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:29:42,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:29:42,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-02-25 15:29:42,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:29:42,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:29:42,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:29:42,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:29:42,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:29:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:29:42,560 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-25 15:29:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:29:42,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:29:42,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:29:42,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:29:42,570 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [30], [32], [33] [2019-02-25 15:29:42,570 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:29:42,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:29:42,572 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:29:42,573 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:29:42,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:29:42,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:29:42,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:29:42,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:29:42,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:29:42,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:29:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:29:42,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:29:42,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:29:42,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:29:42,618 INFO L467 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 24 treesize of output 26 [2019-02-25 15:29:42,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:42,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:42,643 INFO L467 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 26 treesize of output 36 [2019-02-25 15:29:42,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:42,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:42,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:42,650 INFO L467 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 28 treesize of output 50 [2019-02-25 15:29:42,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:42,657 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:42,658 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:42,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:42,659 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:29:42,668 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:29:42,668 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:42,692 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:42,711 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:42,727 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:42,739 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:42,751 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:42,787 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:29:42,788 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:42,794 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:42,806 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:42,822 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:29:42,851 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:42,851 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-25 15:29:42,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:42,892 INFO L467 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 66 [2019-02-25 15:29:42,893 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:29:42,978 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:29:42,978 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-02-25 15:29:43,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:43,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:43,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:29:43,020 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 45 [2019-02-25 15:29:43,021 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:29:43,038 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:29:43,038 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2019-02-25 15:29:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:29:43,053 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:29:43,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:29:43,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:29:43,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-25 15:29:43,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:29:43,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:29:43,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:29:43,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:29:43,088 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 7 states. [2019-02-25 15:29:55,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:29:55,196 INFO L93 Difference]: Finished difference Result 12974 states and 91967 transitions. [2019-02-25 15:29:55,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:29:55,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-25 15:29:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:29:55,244 INFO L225 Difference]: With dead ends: 12974 [2019-02-25 15:29:55,244 INFO L226 Difference]: Without dead ends: 12973 [2019-02-25 15:29:55,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:29:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2019-02-25 15:30:08,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12958. [2019-02-25 15:30:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-02-25 15:30:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-02-25 15:30:08,687 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-02-25 15:30:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:30:08,687 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-02-25 15:30:08,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:30:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-02-25 15:30:08,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:30:08,698 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:30:08,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:30:08,698 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:30:08,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:30:08,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-02-25 15:30:08,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:30:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:30:08,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:30:08,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:30:08,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:30:08,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:30:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:30:08,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:30:08,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:30:08,758 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:30:08,758 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [30], [31] [2019-02-25 15:30:08,758 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:30:08,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:30:08,760 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:30:08,760 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:30:08,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:30:08,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:30:08,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:30:08,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:30:08,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:30:08,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:30:08,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:30:08,774 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:30:08,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:30:08,778 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:30:08,781 INFO L467 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 24 treesize of output 26 [2019-02-25 15:30:08,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,786 INFO L467 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 26 treesize of output 36 [2019-02-25 15:30:08,790 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,793 INFO L467 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 28 treesize of output 50 [2019-02-25 15:30:08,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,802 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:30:08,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:08,813 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:30:08,814 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:08,851 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:08,871 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:08,888 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:08,900 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:08,913 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:08,960 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:30:08,961 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:08,973 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:08,982 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:08,999 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:09,024 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:09,065 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:09,065 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:30:09,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,107 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:30:09,108 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:30:09,243 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:30:09,243 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:122 [2019-02-25 15:30:09,377 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2019-02-25 15:30:09,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,384 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:30:09,385 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:30:09,385 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:09,412 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:09,412 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 15:30:09,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:09,443 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:30:09,444 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:09,470 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:09,470 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-02-25 15:30:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:30:09,492 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:30:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:30:09,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:30:09,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:30:09,544 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:30:09,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:30:09,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:30:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:30:09,544 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 10 states. [2019-02-25 15:30:22,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:30:22,263 INFO L93 Difference]: Finished difference Result 13106 states and 92752 transitions. [2019-02-25 15:30:22,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:30:22,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:30:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:30:22,310 INFO L225 Difference]: With dead ends: 13106 [2019-02-25 15:30:22,310 INFO L226 Difference]: Without dead ends: 13105 [2019-02-25 15:30:22,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:30:22,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-02-25 15:30:35,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 13023. [2019-02-25 15:30:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13023 states. [2019-02-25 15:30:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13023 states to 13023 states and 92401 transitions. [2019-02-25 15:30:35,592 INFO L78 Accepts]: Start accepts. Automaton has 13023 states and 92401 transitions. Word has length 7 [2019-02-25 15:30:35,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:30:35,592 INFO L480 AbstractCegarLoop]: Abstraction has 13023 states and 92401 transitions. [2019-02-25 15:30:35,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:30:35,592 INFO L276 IsEmpty]: Start isEmpty. Operand 13023 states and 92401 transitions. [2019-02-25 15:30:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:30:35,603 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:30:35,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:30:35,603 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:30:35,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:30:35,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-02-25 15:30:35,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:30:35,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:30:35,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:30:35,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:30:35,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:30:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:30:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:30:35,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:30:35,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:30:35,701 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:30:35,701 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [24], [28], [29] [2019-02-25 15:30:35,702 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:30:35,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:30:35,703 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:30:35,704 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:30:35,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:30:35,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:30:35,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:30:35,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:30:35,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:30:35,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:30:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:30:35,899 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:30:35,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:30:35,903 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:30:35,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,906 INFO L467 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 24 treesize of output 30 [2019-02-25 15:30:35,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,912 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:30:35,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,917 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,919 INFO L467 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 28 treesize of output 54 [2019-02-25 15:30:35,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,926 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:30:35,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:35,935 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:30:35,935 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:35,975 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:35,997 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,015 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,028 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,041 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,092 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:30:36,093 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,106 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,117 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,134 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,155 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,182 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,226 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:36,226 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:30:36,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,271 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:30:36,271 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,312 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:36,312 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:30:36,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,354 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:30:36,355 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:30:36,356 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,395 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:36,395 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-02-25 15:30:36,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,437 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:30:36,437 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,477 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:36,477 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-02-25 15:30:36,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,511 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:30:36,519 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:30:36,520 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:30:36,521 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:30:36,559 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:30:36,559 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-02-25 15:30:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:30:36,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:30:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:30:36,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:30:36,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:30:36,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:30:36,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:30:36,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:30:36,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:30:36,674 INFO L87 Difference]: Start difference. First operand 13023 states and 92401 transitions. Second operand 12 states. [2019-02-25 15:30:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:30:49,796 INFO L93 Difference]: Finished difference Result 13278 states and 93926 transitions. [2019-02-25 15:30:49,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:30:49,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:30:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:30:49,845 INFO L225 Difference]: With dead ends: 13278 [2019-02-25 15:30:49,845 INFO L226 Difference]: Without dead ends: 13277 [2019-02-25 15:30:49,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:30:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-02-25 15:31:03,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2019-02-25 15:31:03,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13233 states. [2019-02-25 15:31:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 93871 transitions. [2019-02-25 15:31:03,537 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 93871 transitions. Word has length 7 [2019-02-25 15:31:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:31:03,537 INFO L480 AbstractCegarLoop]: Abstraction has 13233 states and 93871 transitions. [2019-02-25 15:31:03,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:31:03,538 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 93871 transitions. [2019-02-25 15:31:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:31:03,549 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:31:03,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:31:03,549 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:31:03,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:31:03,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1935214964, now seen corresponding path program 1 times [2019-02-25 15:31:03,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:31:03,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:31:03,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:31:03,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:31:03,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:31:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:31:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:31:03,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:31:03,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:31:03,694 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:31:03,694 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [22], [28], [29] [2019-02-25 15:31:03,695 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:31:03,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:31:03,697 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:31:03,697 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:31:03,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:31:03,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:31:03,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:31:03,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:31:03,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:31:03,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:31:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:31:03,715 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:31:03,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:31:03,721 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:31:03,723 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:03,723 INFO L467 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 24 treesize of output 30 [2019-02-25 15:31:03,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:03,727 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:03,727 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:31:03,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:03,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:03,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:03,735 INFO L467 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 28 treesize of output 54 [2019-02-25 15:31:03,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:03,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:03,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:03,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:03,743 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:31:03,750 INFO L467 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 32 treesize of output 71 [2019-02-25 15:31:03,751 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:03,784 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:03,806 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:03,823 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:03,837 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:03,850 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:03,891 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:31:03,891 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:03,904 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:03,911 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:03,925 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:03,942 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:03,973 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:31:03,974 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:31:04,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,024 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:31:04,025 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:04,052 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:31:04,052 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:31:04,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,082 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,083 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,084 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,085 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:31:04,086 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:31:04,086 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:04,113 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:31:04,113 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 15:31:04,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,140 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,143 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:31:04,144 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:04,170 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:31:04,170 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-25 15:31:04,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,193 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,196 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:04,200 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:31:04,201 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:31:04,201 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:04,228 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:31:04,228 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-25 15:31:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:31:04,258 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:31:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:31:04,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:31:04,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-25 15:31:04,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:31:04,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:31:04,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:31:04,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:31:04,347 INFO L87 Difference]: Start difference. First operand 13233 states and 93871 transitions. Second operand 13 states. [2019-02-25 15:31:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:31:20,831 INFO L93 Difference]: Finished difference Result 17581 states and 124519 transitions. [2019-02-25 15:31:20,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:31:20,831 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-25 15:31:20,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:31:20,893 INFO L225 Difference]: With dead ends: 17581 [2019-02-25 15:31:20,894 INFO L226 Difference]: Without dead ends: 17580 [2019-02-25 15:31:20,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:31:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-02-25 15:31:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9927. [2019-02-25 15:31:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-02-25 15:31:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-02-25 15:31:31,476 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-02-25 15:31:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:31:31,477 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-02-25 15:31:31,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:31:31,477 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-02-25 15:31:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:31:31,485 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:31:31,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:31:31,486 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:31:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:31:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-02-25 15:31:31,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:31:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:31:31,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:31:31,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:31:31,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:31:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:31:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:31:31,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:31:31,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:31:31,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:31:31,543 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [30], [32], [33] [2019-02-25 15:31:31,544 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:31:31,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:31:31,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:31:31,545 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:31:31,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:31:31,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:31:31,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:31:31,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:31:31,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:31:31,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:31:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:31:31,559 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:31:31,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:31:31,563 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:31:31,566 INFO L467 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 24 treesize of output 26 [2019-02-25 15:31:31,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,573 INFO L467 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 26 treesize of output 36 [2019-02-25 15:31:31,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,581 INFO L467 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 28 treesize of output 50 [2019-02-25 15:31:31,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,589 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:31:31,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,605 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,606 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,606 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:31:31,607 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:31,644 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:31,664 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:31,680 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:31,693 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:31,706 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:31,752 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:31:31,753 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:31,765 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:31,777 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:31,798 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:31,822 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:31,863 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:31:31,863 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:31:31,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:31,896 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:31:31,897 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:31:32,028 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:31:32,028 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-02-25 15:31:32,277 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 41 [2019-02-25 15:31:32,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:32,282 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:31:32,282 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:31:32,283 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:32,308 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:31:32,309 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-02-25 15:31:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:31:32,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:31:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:31:32,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:31:32,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:31:32,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:31:32,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:31:32,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:31:32,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:31:32,367 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 8 states. [2019-02-25 15:31:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:31:42,448 INFO L93 Difference]: Finished difference Result 9947 states and 70395 transitions. [2019-02-25 15:31:42,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:31:42,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:31:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:31:42,482 INFO L225 Difference]: With dead ends: 9947 [2019-02-25 15:31:42,482 INFO L226 Difference]: Without dead ends: 9946 [2019-02-25 15:31:42,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:31:42,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2019-02-25 15:31:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9927. [2019-02-25 15:31:52,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-02-25 15:31:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-02-25 15:31:52,772 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-02-25 15:31:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:31:52,772 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-02-25 15:31:52,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:31:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-02-25 15:31:52,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:31:52,781 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:31:52,781 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-25 15:31:52,781 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:31:52,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:31:52,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 3 times [2019-02-25 15:31:52,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:31:52,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:31:52,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:31:52,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:31:52,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:31:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:31:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:31:52,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:31:52,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:31:52,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:31:52,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:31:52,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:31:52,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:31:52,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:31:52,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:31:52,855 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:31:52,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:31:52,855 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:31:52,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:31:52,859 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:31:52,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:52,862 INFO L467 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 24 treesize of output 30 [2019-02-25 15:31:52,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:52,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:52,868 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:31:52,872 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:52,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:52,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:52,876 INFO L467 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 28 treesize of output 54 [2019-02-25 15:31:52,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:52,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:52,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:52,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:52,883 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:31:52,891 INFO L467 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 32 treesize of output 71 [2019-02-25 15:31:52,891 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:52,918 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:52,938 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:52,955 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:52,968 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:52,980 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:53,021 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:31:53,022 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:53,032 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:53,040 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:53,051 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:53,068 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:31:53,099 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:31:53,099 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:31:53,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,207 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 15:31:53,208 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:31:53,308 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-25 15:31:53,308 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:109 [2019-02-25 15:31:53,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,418 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:31:53,419 INFO L467 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 60 treesize of output 66 [2019-02-25 15:31:53,419 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:53,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,493 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,494 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,498 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,527 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 65 treesize of output 95 [2019-02-25 15:31:53,532 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-02-25 15:31:53,819 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2019-02-25 15:31:53,819 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:280 [2019-02-25 15:31:53,962 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-02-25 15:31:53,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:53,975 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:31:53,975 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:31:53,976 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:54,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,105 INFO L467 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 50 treesize of output 66 [2019-02-25 15:31:54,106 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:54,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,224 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,229 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:31:54,230 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 72 [2019-02-25 15:31:54,231 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:54,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,353 INFO L467 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 76 treesize of output 66 [2019-02-25 15:31:54,353 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:54,432 INFO L301 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-25 15:31:54,433 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:161 [2019-02-25 15:31:54,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,517 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:31:54,518 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:54,618 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,619 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,623 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,629 INFO L467 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 50 treesize of output 66 [2019-02-25 15:31:54,629 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:54,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,748 INFO L467 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 76 [2019-02-25 15:31:54,748 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:54,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,871 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:54,872 INFO L467 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 68 [2019-02-25 15:31:54,872 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:54,957 INFO L301 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-25 15:31:54,958 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:209, output treesize:153 [2019-02-25 15:31:55,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,054 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,055 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,057 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,060 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:31:55,060 INFO L467 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 44 treesize of output 70 [2019-02-25 15:31:55,061 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:55,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,170 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,178 INFO L467 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 50 treesize of output 76 [2019-02-25 15:31:55,179 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:55,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,295 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:31:55,296 INFO L467 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 44 treesize of output 72 [2019-02-25 15:31:55,296 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:55,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:31:55,396 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:31:55,396 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:31:55,469 INFO L301 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-02-25 15:31:55,470 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:143 [2019-02-25 15:31:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:31:55,561 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:31:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:31:55,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:31:55,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-25 15:31:55,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:31:55,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:31:55,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:31:55,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:31:55,720 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 13 states. [2019-02-25 15:31:55,906 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-02-25 15:31:56,173 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-02-25 15:31:56,456 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-02-25 15:31:57,624 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-02-25 15:31:59,162 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-02-25 15:32:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:32:10,990 INFO L93 Difference]: Finished difference Result 12394 states and 87417 transitions. [2019-02-25 15:32:10,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:32:10,990 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-25 15:32:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:32:11,034 INFO L225 Difference]: With dead ends: 12394 [2019-02-25 15:32:11,034 INFO L226 Difference]: Without dead ends: 12392 [2019-02-25 15:32:11,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:32:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-02-25 15:32:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 7195. [2019-02-25 15:32:20,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-02-25 15:32:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 51194 transitions. [2019-02-25 15:32:20,196 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 51194 transitions. Word has length 7 [2019-02-25 15:32:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:32:20,196 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 51194 transitions. [2019-02-25 15:32:20,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:32:20,196 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 51194 transitions. [2019-02-25 15:32:20,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:32:20,202 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:32:20,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:32:20,202 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:32:20,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:32:20,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-02-25 15:32:20,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:32:20,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:32:20,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:32:20,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:32:20,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:32:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:32:20,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:32:20,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:32:20,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:32:20,275 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:32:20,275 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [28], [30], [31] [2019-02-25 15:32:20,276 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:32:20,276 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:32:20,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:32:20,278 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:32:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:32:20,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:32:20,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:32:20,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:32:20,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:32:20,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:32:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:32:20,295 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:32:20,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:32:20,299 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:32:20,306 INFO L467 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 24 treesize of output 26 [2019-02-25 15:32:20,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,311 INFO L467 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 26 treesize of output 36 [2019-02-25 15:32:20,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,318 INFO L467 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 28 treesize of output 50 [2019-02-25 15:32:20,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,344 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:32:20,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,354 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:32:20,355 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,392 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,411 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,426 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,438 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,451 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,498 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:32:20,498 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,510 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,522 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,542 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,567 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,607 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:32:20,608 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:32:20,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,651 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:32:20,651 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:32:20,782 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:32:20,782 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:122 [2019-02-25 15:32:20,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,838 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 115 [2019-02-25 15:32:20,838 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:20,928 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:32:20,928 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:20,984 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:32:20,984 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:142, output treesize:94 [2019-02-25 15:32:21,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,032 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,039 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:32:21,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 68 [2019-02-25 15:32:21,040 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:21,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:21,113 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:32:21,113 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 109 [2019-02-25 15:32:21,114 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:21,188 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-25 15:32:21,188 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:102 [2019-02-25 15:32:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:32:21,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:32:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:32:21,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:32:21,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:32:21,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:32:21,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:32:21,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:32:21,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:32:21,312 INFO L87 Difference]: Start difference. First operand 7195 states and 51194 transitions. Second operand 10 states. [2019-02-25 15:32:21,512 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-02-25 15:32:25,049 WARN L181 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-02-25 15:32:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:32:33,191 INFO L93 Difference]: Finished difference Result 7367 states and 52064 transitions. [2019-02-25 15:32:33,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:32:33,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:32:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:32:33,214 INFO L225 Difference]: With dead ends: 7367 [2019-02-25 15:32:33,214 INFO L226 Difference]: Without dead ends: 7366 [2019-02-25 15:32:33,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:32:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-02-25 15:32:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7259. [2019-02-25 15:32:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-02-25 15:32:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 51642 transitions. [2019-02-25 15:32:42,316 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 51642 transitions. Word has length 7 [2019-02-25 15:32:42,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:32:42,317 INFO L480 AbstractCegarLoop]: Abstraction has 7259 states and 51642 transitions. [2019-02-25 15:32:42,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:32:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 51642 transitions. [2019-02-25 15:32:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:32:42,323 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:32:42,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:32:42,323 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:32:42,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:32:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-02-25 15:32:42,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:32:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:32:42,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:32:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:32:42,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:32:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:32:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:32:42,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:32:42,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:32:42,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:32:42,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:32:42,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:32:42,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:32:42,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:32:42,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:32:42,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:32:42,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:32:42,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:32:42,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:32:42,488 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:32:42,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,493 INFO L467 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 24 treesize of output 30 [2019-02-25 15:32:42,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,496 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,497 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:32:42,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,501 INFO L467 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 28 treesize of output 54 [2019-02-25 15:32:42,505 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,509 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:32:42,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,518 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:32:42,518 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,559 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,581 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,599 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,612 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,625 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,676 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:32:42,676 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,693 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,705 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,719 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,739 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,766 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,810 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:32:42,810 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:32:42,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,847 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:32:42,847 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,890 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:32:42,890 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:32:42,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,925 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:32:42,925 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:42,968 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:32:42,968 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:32:42,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:42,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,007 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:32:43,007 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:32:43,008 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:43,048 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:32:43,048 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:32:43,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,076 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,077 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,078 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,081 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,082 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,083 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,084 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,086 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,088 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:32:43,088 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:32:43,089 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:32:43,089 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:32:43,129 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:32:43,129 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-02-25 15:32:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:32:43,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:32:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:32:43,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:32:43,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:32:43,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:32:43,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:32:43,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:32:43,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:32:43,222 INFO L87 Difference]: Start difference. First operand 7259 states and 51642 transitions. Second operand 11 states. [2019-02-25 15:32:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:32:58,981 INFO L93 Difference]: Finished difference Result 9936 states and 70364 transitions. [2019-02-25 15:32:58,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:32:58,981 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:32:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:32:59,012 INFO L225 Difference]: With dead ends: 9936 [2019-02-25 15:32:59,012 INFO L226 Difference]: Without dead ends: 9935 [2019-02-25 15:32:59,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:32:59,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-02-25 15:33:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8951. [2019-02-25 15:33:12,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2019-02-25 15:33:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 63743 transitions. [2019-02-25 15:33:12,703 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 63743 transitions. Word has length 7 [2019-02-25 15:33:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:33:12,703 INFO L480 AbstractCegarLoop]: Abstraction has 8951 states and 63743 transitions. [2019-02-25 15:33:12,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:33:12,704 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 63743 transitions. [2019-02-25 15:33:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:33:12,711 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:33:12,711 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:33:12,711 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:33:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:33:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-02-25 15:33:12,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:33:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:33:12,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:33:12,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:33:12,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:33:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:33:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:33:12,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:33:12,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:33:12,810 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:33:12,811 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [30], [31] [2019-02-25 15:33:12,811 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:33:12,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:33:12,813 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:33:12,813 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:33:12,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:33:12,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:33:12,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:33:12,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:33:12,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:33:12,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:33:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:33:12,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:33:12,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:33:12,853 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:33:12,853 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:33:12,866 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:12,880 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:12,902 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:12,929 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:12,960 INFO L467 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 21 treesize of output 24 [2019-02-25 15:33:12,963 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:33:12,968 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:33:12,971 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:33:12,975 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:33:12,978 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:33:12,978 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:33:13,010 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:13,028 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:13,042 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:13,053 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:13,064 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:13,105 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:33:13,105 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:33:13,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,143 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:33:13,144 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:33:13,276 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:33:13,276 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:122 [2019-02-25 15:33:13,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,327 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:33:13,328 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:33:13,328 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:33:13,363 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:33:13,363 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 15:33:13,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:13,391 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select 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 66 [2019-02-25 15:33:13,392 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:33:13,423 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:33:13,424 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-02-25 15:33:13,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:33:13,446 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:33:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:33:13,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:33:13,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:33:13,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:33:13,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:33:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:33:13,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:33:13,490 INFO L87 Difference]: Start difference. First operand 8951 states and 63743 transitions. Second operand 10 states. [2019-02-25 15:33:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:33:27,732 INFO L93 Difference]: Finished difference Result 9235 states and 65371 transitions. [2019-02-25 15:33:27,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:33:27,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:33:27,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:33:27,762 INFO L225 Difference]: With dead ends: 9235 [2019-02-25 15:33:27,762 INFO L226 Difference]: Without dead ends: 9232 [2019-02-25 15:33:27,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:33:27,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-02-25 15:33:42,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 9044. [2019-02-25 15:33:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-02-25 15:33:42,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 64394 transitions. [2019-02-25 15:33:42,560 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 64394 transitions. Word has length 7 [2019-02-25 15:33:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:33:42,560 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 64394 transitions. [2019-02-25 15:33:42,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:33:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 64394 transitions. [2019-02-25 15:33:42,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:33:42,568 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:33:42,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:33:42,568 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:33:42,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:33:42,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-02-25 15:33:42,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:33:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:33:42,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:33:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:33:42,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:33:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:33:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:33:42,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:33:42,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:33:42,634 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:33:42,634 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [30], [32], [33] [2019-02-25 15:33:42,635 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:33:42,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:33:42,636 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:33:42,636 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:33:42,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:33:42,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:33:42,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:33:42,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:33:42,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:33:42,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:33:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:33:42,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:33:42,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:33:42,748 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:33:42,749 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:33:42,757 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:42,766 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:42,782 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:42,803 INFO L467 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 21 treesize of output 24 [2019-02-25 15:33:42,807 INFO L467 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 24 treesize of output 26 [2019-02-25 15:33:42,810 INFO L467 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 26 treesize of output 36 [2019-02-25 15:33:42,814 INFO L467 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 28 treesize of output 50 [2019-02-25 15:33:42,818 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:33:42,826 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:33:42,827 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:33:42,851 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:42,868 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:42,882 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:42,893 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:42,904 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:33:42,933 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:33:42,933 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:33:42,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:42,978 INFO L467 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 66 [2019-02-25 15:33:42,979 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:33:43,063 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:33:43,063 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-02-25 15:33:43,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:33:43,118 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:33:43,118 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:33:43,119 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:33:43,137 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:33:43,138 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-02-25 15:33:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:33:43,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:33:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:33:43,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:33:43,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:33:43,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:33:43,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:33:43,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:33:43,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:33:43,195 INFO L87 Difference]: Start difference. First operand 9044 states and 64394 transitions. Second operand 8 states. [2019-02-25 15:33:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:33:56,590 INFO L93 Difference]: Finished difference Result 9065 states and 64420 transitions. [2019-02-25 15:33:56,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:33:56,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:33:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:33:56,621 INFO L225 Difference]: With dead ends: 9065 [2019-02-25 15:33:56,621 INFO L226 Difference]: Without dead ends: 9064 [2019-02-25 15:33:56,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:33:56,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-02-25 15:34:10,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9045. [2019-02-25 15:34:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9045 states. [2019-02-25 15:34:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 64401 transitions. [2019-02-25 15:34:10,890 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 64401 transitions. Word has length 7 [2019-02-25 15:34:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:34:10,890 INFO L480 AbstractCegarLoop]: Abstraction has 9045 states and 64401 transitions. [2019-02-25 15:34:10,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:34:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 64401 transitions. [2019-02-25 15:34:10,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:34:10,898 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:34:10,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:34:10,898 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:34:10,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:34:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1904967206, now seen corresponding path program 1 times [2019-02-25 15:34:10,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:34:10,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:34:10,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:34:10,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:34:10,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:34:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:34:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:34:10,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:34:10,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:34:10,971 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:34:10,971 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [24], [27] [2019-02-25 15:34:10,972 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:34:10,972 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:34:10,974 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:34:10,974 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:34:10,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:34:10,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:34:10,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:34:10,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:34:10,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:34:10,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:34:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:34:10,990 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:34:10,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:34:11,032 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:34:11,032 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,048 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,056 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,070 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,090 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,125 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,164 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:34:11,166 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:34:11,169 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:34:11,172 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:34:11,175 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:34:11,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:34:11,178 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,212 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,232 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,247 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,259 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,270 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,313 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,314 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:92, output treesize:91 [2019-02-25 15:34:11,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,366 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:34:11,366 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,406 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:34:11,406 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:71 [2019-02-25 15:34:11,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,454 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:34:11,455 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,495 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:34:11,495 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:55 [2019-02-25 15:34:11,530 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,531 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,537 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,539 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:34:11,540 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:34:11,541 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,580 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:34:11,580 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-02-25 15:34:11,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,614 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,618 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,619 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,620 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:34:11,621 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:34:11,621 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,659 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:34:11,660 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:51 [2019-02-25 15:34:11,723 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,723 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,724 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,727 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:11,734 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:34:11,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 97 [2019-02-25 15:34:11,735 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:11,772 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:34:11,772 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:53 [2019-02-25 15:34:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:34:11,800 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:34:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:34:11,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:34:11,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-25 15:34:11,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:34:11,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:34:11,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:34:11,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:34:11,910 INFO L87 Difference]: Start difference. First operand 9045 states and 64401 transitions. Second operand 14 states. [2019-02-25 15:34:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:34:29,504 INFO L93 Difference]: Finished difference Result 9411 states and 66754 transitions. [2019-02-25 15:34:29,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:34:29,505 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-25 15:34:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:34:29,536 INFO L225 Difference]: With dead ends: 9411 [2019-02-25 15:34:29,536 INFO L226 Difference]: Without dead ends: 9409 [2019-02-25 15:34:29,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-02-25 15:34:29,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2019-02-25 15:34:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 8693. [2019-02-25 15:34:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-02-25 15:34:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 61400 transitions. [2019-02-25 15:34:43,801 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 61400 transitions. Word has length 7 [2019-02-25 15:34:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:34:43,801 INFO L480 AbstractCegarLoop]: Abstraction has 8693 states and 61400 transitions. [2019-02-25 15:34:43,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:34:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 61400 transitions. [2019-02-25 15:34:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:34:43,809 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:34:43,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:34:43,809 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:34:43,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:34:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1916458534, now seen corresponding path program 1 times [2019-02-25 15:34:43,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:34:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:34:43,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:34:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:34:43,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:34:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:34:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:34:43,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:34:43,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:34:43,955 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:34:43,955 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [24], [27] [2019-02-25 15:34:43,956 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:34:43,956 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:34:43,959 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:34:43,959 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:34:43,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:34:43,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:34:43,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:34:43,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:34:43,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:34:43,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:34:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:34:43,987 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:34:43,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:34:44,014 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:34:44,015 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,031 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,043 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,058 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,082 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,110 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,144 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2019-02-25 15:34:44,146 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:34:44,149 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:34:44,152 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:34:44,155 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:34:44,158 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:34:44,159 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,193 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,212 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,227 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,240 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,251 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,294 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:34:44,294 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:34:44,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,344 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:34:44,344 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,495 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:34:44,495 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:34:44,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,537 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,541 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:34:44,541 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:34:44,542 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,581 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:34:44,581 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2019-02-25 15:34:44,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,618 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,619 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,622 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:34:44,622 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,661 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:34:44,661 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2019-02-25 15:34:44,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,694 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,699 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,701 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:34:44,702 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:34:44,702 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,741 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:34:44,741 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-02-25 15:34:44,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:34:44,782 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:34:44,783 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:34:44,783 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:34:44,822 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:34:44,823 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:51 [2019-02-25 15:34:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:34:44,853 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:34:44,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:34:44,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:34:44,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-25 15:34:44,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:34:44,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:34:44,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:34:44,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:34:44,950 INFO L87 Difference]: Start difference. First operand 8693 states and 61400 transitions. Second operand 14 states. [2019-02-25 15:35:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:35:00,565 INFO L93 Difference]: Finished difference Result 8797 states and 61626 transitions. [2019-02-25 15:35:00,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:35:00,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-25 15:35:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:35:00,591 INFO L225 Difference]: With dead ends: 8797 [2019-02-25 15:35:00,591 INFO L226 Difference]: Without dead ends: 8791 [2019-02-25 15:35:00,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:35:00,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8791 states. [2019-02-25 15:35:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8791 to 1900. [2019-02-25 15:35:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-02-25 15:35:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 13072 transitions. [2019-02-25 15:35:08,389 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 13072 transitions. Word has length 7 [2019-02-25 15:35:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:35:08,390 INFO L480 AbstractCegarLoop]: Abstraction has 1900 states and 13072 transitions. [2019-02-25 15:35:08,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:35:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 13072 transitions. [2019-02-25 15:35:08,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:35:08,392 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:35:08,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:35:08,392 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:35:08,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:35:08,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1899825356, now seen corresponding path program 1 times [2019-02-25 15:35:08,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:35:08,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:35:08,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:35:08,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:35:08,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:35:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:35:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:35:08,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:35:08,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:35:08,453 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:35:08,453 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [30], [31] [2019-02-25 15:35:08,454 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:35:08,454 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:35:08,455 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:35:08,456 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:35:08,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:35:08,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:35:08,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:35:08,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:35:08,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:35:08,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:35:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:35:08,470 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:35:08,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:35:08,495 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:35:08,495 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,508 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,521 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,541 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,567 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,599 INFO L467 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 21 treesize of output 24 [2019-02-25 15:35:08,603 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:35:08,606 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:35:08,610 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:35:08,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:35:08,617 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:35:08,617 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,648 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,666 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,680 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,691 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,702 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,743 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:35:08,743 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:35:08,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,777 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:35:08,777 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,816 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:35:08,816 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 15:35:08,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,851 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:35:08,852 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:35:08,887 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:35:08,887 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-02-25 15:35:08,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,913 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,917 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:08,922 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:35:08,931 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:35:08,932 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:35:09,048 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-25 15:35:09,048 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:94 [2019-02-25 15:35:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:35:11,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:35:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:35:11,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:35:11,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:35:11,164 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:35:11,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:35:11,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:35:11,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=114, Unknown=1, NotChecked=0, Total=182 [2019-02-25 15:35:11,165 INFO L87 Difference]: Start difference. First operand 1900 states and 13072 transitions. Second operand 10 states. [2019-02-25 15:35:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:35:20,879 INFO L93 Difference]: Finished difference Result 1963 states and 13288 transitions. [2019-02-25 15:35:20,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:35:20,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:35:20,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:35:20,885 INFO L225 Difference]: With dead ends: 1963 [2019-02-25 15:35:20,885 INFO L226 Difference]: Without dead ends: 1962 [2019-02-25 15:35:20,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=100, Invalid=171, Unknown=1, NotChecked=0, Total=272 [2019-02-25 15:35:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-02-25 15:35:28,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1925. [2019-02-25 15:35:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-02-25 15:35:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 13247 transitions. [2019-02-25 15:35:28,766 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 13247 transitions. Word has length 7 [2019-02-25 15:35:28,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:35:28,766 INFO L480 AbstractCegarLoop]: Abstraction has 1925 states and 13247 transitions. [2019-02-25 15:35:28,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:35:28,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 13247 transitions. [2019-02-25 15:35:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:35:28,770 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:35:28,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:35:28,770 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:35:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:35:28,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1912516322, now seen corresponding path program 1 times [2019-02-25 15:35:28,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:35:28,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:35:28,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:35:28,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:35:28,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:35:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:35:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:35:28,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:35:28,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:35:28,859 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:35:28,859 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [28], [30], [31] [2019-02-25 15:35:28,860 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:35:28,860 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:35:28,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:35:28,862 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:35:28,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:35:28,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:35:28,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:35:28,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:35:28,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:35:28,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:35:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:35:28,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:35:28,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:35:28,883 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:35:28,886 INFO L467 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 24 treesize of output 26 [2019-02-25 15:35:28,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:28,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:28,890 INFO L467 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 26 treesize of output 36 [2019-02-25 15:35:28,896 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:28,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:28,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:28,900 INFO L467 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 28 treesize of output 50 [2019-02-25 15:35:28,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:28,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:28,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:28,908 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:28,909 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:35:28,919 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:35:28,920 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:35:28,946 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:28,964 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:28,979 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:28,992 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:29,004 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:29,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:35:29,040 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:35:29,049 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:29,059 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:29,074 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:29,103 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:35:29,103 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-25 15:35:29,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,148 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:35:29,148 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:35:29,165 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:35:29,165 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:35:29,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,191 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 45 [2019-02-25 15:35:29,191 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:35:29,207 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:35:29,208 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-25 15:35:29,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:29,233 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:35:29,234 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select 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 47 [2019-02-25 15:35:29,234 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:35:29,250 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:35:29,251 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 15:35:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:35:29,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:35:29,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:35:29,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:35:29,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2019-02-25 15:35:29,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:35:29,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:35:29,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:35:29,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:35:29,329 INFO L87 Difference]: Start difference. First operand 1925 states and 13247 transitions. Second operand 11 states. [2019-02-25 15:35:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:35:37,168 INFO L93 Difference]: Finished difference Result 2000 states and 13456 transitions. [2019-02-25 15:35:37,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:35:37,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:35:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:35:37,174 INFO L225 Difference]: With dead ends: 2000 [2019-02-25 15:35:37,174 INFO L226 Difference]: Without dead ends: 1999 [2019-02-25 15:35:37,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:35:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-02-25 15:35:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1945. [2019-02-25 15:35:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2019-02-25 15:35:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 13387 transitions. [2019-02-25 15:35:44,931 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 13387 transitions. Word has length 7 [2019-02-25 15:35:44,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:35:44,931 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 13387 transitions. [2019-02-25 15:35:44,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:35:44,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 13387 transitions. [2019-02-25 15:35:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:35:44,934 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:35:44,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:35:44,934 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:35:44,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:35:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1895531480, now seen corresponding path program 1 times [2019-02-25 15:35:44,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:35:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:35:44,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:35:44,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:35:44,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:35:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:35:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:35:44,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:35:44,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:35:44,953 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:35:44,954 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [30], [32], [34], [35] [2019-02-25 15:35:44,954 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:35:44,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:35:44,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:35:44,957 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:35:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:35:44,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:35:44,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:35:44,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:35:44,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:35:44,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:35:44,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:35:44,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:35:44,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:35:44,974 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:35:44,976 INFO L467 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 24 treesize of output 26 [2019-02-25 15:35:44,983 INFO L467 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 26 treesize of output 28 [2019-02-25 15:35:44,990 INFO L467 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 28 treesize of output 30 [2019-02-25 15:35:45,241 INFO L292 Elim1Store]: Index analysis took 250 ms [2019-02-25 15:35:45,242 INFO L467 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-02-25 15:35:45,256 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-25 15:35:45,257 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:35:45,267 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:45,278 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:45,289 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:45,299 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:45,310 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:45,321 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:35:45,321 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:21, output treesize:31 [2019-02-25 15:35:45,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:35:45,326 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-25 15:35:45,326 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:35:45,327 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:35:45,327 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-25 15:35:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:35:45,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:35:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:35:45,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:35:45,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-25 15:35:45,354 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:35:45,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:35:45,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:35:45,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:35:45,355 INFO L87 Difference]: Start difference. First operand 1945 states and 13387 transitions. Second operand 4 states. [2019-02-25 15:35:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:35:56,522 INFO L93 Difference]: Finished difference Result 3175 states and 21705 transitions. [2019-02-25 15:35:56,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:35:56,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-25 15:35:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:35:56,531 INFO L225 Difference]: With dead ends: 3175 [2019-02-25 15:35:56,531 INFO L226 Difference]: Without dead ends: 3170 [2019-02-25 15:35:56,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:35:56,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2019-02-25 15:36:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3133. [2019-02-25 15:36:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2019-02-25 15:36:08,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 21649 transitions. [2019-02-25 15:36:08,438 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 21649 transitions. Word has length 7 [2019-02-25 15:36:08,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:08,439 INFO L480 AbstractCegarLoop]: Abstraction has 3133 states and 21649 transitions. [2019-02-25 15:36:08,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:36:08,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 21649 transitions. [2019-02-25 15:36:08,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:36:08,443 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:08,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:36:08,443 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:08,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:08,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1908522342, now seen corresponding path program 1 times [2019-02-25 15:36:08,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:08,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:08,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:08,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:08,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:08,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:08,495 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:36:08,495 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [30], [32], [33] [2019-02-25 15:36:08,495 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:36:08,496 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:36:08,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:36:08,497 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:36:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:08,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:36:08,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:08,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:08,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:08,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:08,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:36:08,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:08,563 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:36:08,567 INFO L467 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 24 treesize of output 26 [2019-02-25 15:36:08,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,573 INFO L467 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 26 treesize of output 36 [2019-02-25 15:36:08,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,581 INFO L467 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 28 treesize of output 50 [2019-02-25 15:36:08,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,592 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:36:08,603 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:36:08,603 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,628 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,648 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,664 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,676 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,688 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,724 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:36:08,724 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,732 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,741 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,756 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,783 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:36:08,783 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:36:08,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,818 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:36:08,818 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,835 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:36:08,835 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 15:36:08,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:08,856 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:36:08,856 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:36:08,857 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:36:08,873 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:36:08,873 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-25 15:36:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:08,890 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:08,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:08,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:08,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:36:08,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:08,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:36:08,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:36:08,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:36:08,929 INFO L87 Difference]: Start difference. First operand 3133 states and 21649 transitions. Second operand 8 states. [2019-02-25 15:36:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:20,080 INFO L93 Difference]: Finished difference Result 3149 states and 21664 transitions. [2019-02-25 15:36:20,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:36:20,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:36:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:20,088 INFO L225 Difference]: With dead ends: 3149 [2019-02-25 15:36:20,089 INFO L226 Difference]: Without dead ends: 3148 [2019-02-25 15:36:20,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:36:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2019-02-25 15:36:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3133. [2019-02-25 15:36:32,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2019-02-25 15:36:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 21649 transitions. [2019-02-25 15:36:32,232 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 21649 transitions. Word has length 7 [2019-02-25 15:36:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:32,233 INFO L480 AbstractCegarLoop]: Abstraction has 3133 states and 21649 transitions. [2019-02-25 15:36:32,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:36:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 21649 transitions. [2019-02-25 15:36:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:36:32,237 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:32,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:36:32,237 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:32,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:32,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1858652208, now seen corresponding path program 1 times [2019-02-25 15:36:32,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:32,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:32,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:32,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:32,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:32,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:32,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:32,354 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:36:32,354 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [32], [33] [2019-02-25 15:36:32,355 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:36:32,355 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:36:32,357 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:36:32,357 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:36:32,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:32,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:36:32,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:32,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:32,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:32,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:32,372 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:36:32,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:32,376 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2019-02-25 15:36:32,379 INFO L467 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 24 treesize of output 26 [2019-02-25 15:36:32,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,385 INFO L467 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 26 treesize of output 36 [2019-02-25 15:36:32,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,393 INFO L467 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 28 treesize of output 50 [2019-02-25 15:36:32,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,402 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:36:32,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,412 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:36:32,412 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,447 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,468 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,484 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,497 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,510 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,554 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:36:32,555 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,565 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,579 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,600 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,625 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,666 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:36:32,666 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:36:32,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,691 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:36:32,692 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:36:32,731 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:36:32,731 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:36:32,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,756 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:36:32,770 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:36:32,770 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:36:32,894 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-25 15:36:32,894 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:98 [2019-02-25 15:36:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:32,950 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:32,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:32,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:32,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:36:32,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:32,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:36:32,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:36:32,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:36:32,990 INFO L87 Difference]: Start difference. First operand 3133 states and 21649 transitions. Second operand 8 states.