java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 11:26:02,306 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 11:26:02,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 11:26:02,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 11:26:02,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 11:26:02,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 11:26:02,322 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 11:26:02,324 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 11:26:02,326 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 11:26:02,327 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 11:26:02,328 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 11:26:02,328 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 11:26:02,329 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 11:26:02,330 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 11:26:02,331 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 11:26:02,332 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 11:26:02,333 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 11:26:02,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 11:26:02,338 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 11:26:02,342 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 11:26:02,343 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 11:26:02,345 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 11:26:02,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 11:26:02,354 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 11:26:02,354 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 11:26:02,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 11:26:02,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 11:26:02,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 11:26:02,361 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 11:26:02,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 11:26:02,365 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 11:26:02,366 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 11:26:02,366 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 11:26:02,367 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 11:26:02,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 11:26:02,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 11:26:02,368 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-15 11:26:02,396 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 11:26:02,396 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 11:26:02,399 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 11:26:02,399 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 11:26:02,399 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 11:26:02,400 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 11:26:02,402 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 11:26:02,402 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 11:26:02,402 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 11:26:02,402 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-15 11:26:02,403 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-15 11:26:02,403 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 11:26:02,403 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 11:26:02,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 11:26:02,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 11:26:02,404 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 11:26:02,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 11:26:02,405 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 11:26:02,406 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 11:26:02,406 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 11:26:02,406 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 11:26:02,406 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 11:26:02,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 11:26:02,407 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 11:26:02,407 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 11:26:02,407 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 11:26:02,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 11:26:02,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 11:26:02,408 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 11:26:02,408 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 11:26:02,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 11:26:02,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 11:26:02,409 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 11:26:02,409 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 11:26:02,409 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 11:26:02,409 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 11:26:02,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 11:26:02,411 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 11:26:02,411 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 11:26:02,442 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 11:26:02,454 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 11:26:02,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 11:26:02,459 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 11:26:02,459 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 11:26:02,460 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2019-02-15 11:26:02,460 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2019-02-15 11:26:02,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 11:26:02,511 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 11:26:02,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 11:26:02,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 11:26:02,512 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 11:26:02,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:26:02" (1/1) ... [2019-02-15 11:26:02,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:26:02" (1/1) ... [2019-02-15 11:26:02,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 11:26:02,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 11:26:02,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 11:26:02,568 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 11:26:02,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:26:02" (1/1) ... [2019-02-15 11:26:02,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:26:02" (1/1) ... [2019-02-15 11:26:02,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:26:02" (1/1) ... [2019-02-15 11:26:02,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:26:02" (1/1) ... [2019-02-15 11:26:02,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:26:02" (1/1) ... [2019-02-15 11:26:02,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:26:02" (1/1) ... [2019-02-15 11:26:02,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:26:02" (1/1) ... [2019-02-15 11:26:02,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 11:26:02,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 11:26:02,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 11:26:02,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 11:26:02,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:26:02" (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-15 11:26:02,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 11:26:02,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 11:26:03,082 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 11:26:03,082 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-15 11:26:03,084 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:26:03 BoogieIcfgContainer [2019-02-15 11:26:03,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 11:26:03,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 11:26:03,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 11:26:03,087 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 11:26:03,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 11:26:02" (1/2) ... [2019-02-15 11:26:03,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@161f5e7b and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 11:26:03, skipping insertion in model container [2019-02-15 11:26:03,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 11:26:03" (2/2) ... [2019-02-15 11:26:03,091 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2019-02-15 11:26:03,099 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 11:26:03,107 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-15 11:26:03,121 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-15 11:26:03,149 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 11:26:03,149 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 11:26:03,149 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 11:26:03,150 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 11:26:03,150 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 11:26:03,150 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 11:26:03,150 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 11:26:03,150 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 11:26:03,165 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-15 11:26:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 11:26:03,171 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:03,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 11:26:03,174 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:03,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:03,180 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-15 11:26:03,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:03,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:03,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:03,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:03,378 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-15 11:26:03,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:26:03,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 11:26:03,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:03,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:26:03,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:26:03,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:26:03,400 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-15 11:26:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:03,637 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-15 11:26:03,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:26:03,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 11:26:03,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:03,653 INFO L225 Difference]: With dead ends: 33 [2019-02-15 11:26:03,654 INFO L226 Difference]: Without dead ends: 28 [2019-02-15 11:26:03,657 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-15 11:26:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-15 11:26:03,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-15 11:26:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 11:26:03,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-15 11:26:03,696 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-15 11:26:03,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:03,697 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-15 11:26:03,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:26:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-15 11:26:03,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:26:03,698 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:03,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:26:03,699 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:03,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:03,700 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-15 11:26:03,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:03,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:03,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:03,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:03,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:03,750 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-15 11:26:03,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:26:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 11:26:03,750 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:03,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 11:26:03,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 11:26:03,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 11:26:03,753 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-15 11:26:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:04,074 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-15 11:26:04,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:26:04,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 11:26:04,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:04,077 INFO L225 Difference]: With dead ends: 28 [2019-02-15 11:26:04,077 INFO L226 Difference]: Without dead ends: 27 [2019-02-15 11:26:04,080 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-15 11:26:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-15 11:26:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-15 11:26:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-15 11:26:04,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-15 11:26:04,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-15 11:26:04,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:04,087 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-15 11:26:04,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 11:26:04,088 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-15 11:26:04,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:26:04,089 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:04,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:26:04,089 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:04,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:04,090 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-15 11:26:04,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:04,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:04,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:04,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:04,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:04,237 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-15 11:26:04,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:04,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:04,238 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:26:04,240 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-15 11:26:04,302 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:04,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:05,298 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:05,300 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:26:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:05,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:05,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:05,307 INFO 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-15 11:26:05,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:05,324 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:05,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:05,543 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:26:05,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:05,765 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-02-15 11:26:05,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:05,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:06,055 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-02-15 11:26:06,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:06,219 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-02-15 11:26:06,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:06,704 WARN L181 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-02-15 11:26:06,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:06,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:06,810 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,854 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,900 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:06,947 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:26:07,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:07,091 INFO L478 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 29 treesize of output 43 [2019-02-15 11:26:07,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:07,128 INFO L478 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 33 treesize of output 75 [2019-02-15 11:26:07,147 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:07,241 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:07,244 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,327 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,393 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,444 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,464 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,484 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,501 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:07,578 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:07,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:07,673 INFO L478 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-15 11:26:07,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:07,784 INFO L267 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-15 11:26:07,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:07,821 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-15 11:26:07,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:07,874 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-15 11:26:07,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:07,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:26:07,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:07,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:26:07,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:26:07,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:26:07,894 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-02-15 11:26:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:08,280 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-02-15 11:26:08,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:26:08,280 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 11:26:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:08,282 INFO L225 Difference]: With dead ends: 54 [2019-02-15 11:26:08,283 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 11:26:08,283 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-15 11:26:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 11:26:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-02-15 11:26:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-15 11:26:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-02-15 11:26:08,289 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-02-15 11:26:08,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:08,289 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-02-15 11:26:08,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:26:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-02-15 11:26:08,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:26:08,290 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:08,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:26:08,291 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:08,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:08,291 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-02-15 11:26:08,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:08,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:08,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:08,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:08,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:08,365 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-15 11:26:08,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:08,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:08,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:26:08,366 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-02-15 11:26:08,371 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:08,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:08,736 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:08,736 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:26:08,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:08,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:08,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:08,737 INFO 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-15 11:26:08,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:08,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:08,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:08,972 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:26:08,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:26:09,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:09,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:09,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:09,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:09,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,153 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:09,174 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:09,175 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,220 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,254 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,280 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:09,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:09,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:09,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:09,748 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-02-15 11:26:09,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:09,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:09,763 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,815 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,842 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,869 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,912 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:09,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:09,965 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:10,142 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-15 11:26:10,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:10,155 INFO L478 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 97 [2019-02-15 11:26:10,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:10,250 INFO L267 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-15 11:26:10,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:10,264 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-15 11:26:10,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:10,270 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-15 11:26:10,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:26:10,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 11:26:10,291 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:10,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:26:10,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:26:10,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:26:10,292 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-02-15 11:26:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:10,363 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-02-15 11:26:10,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:26:10,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 11:26:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:10,365 INFO L225 Difference]: With dead ends: 25 [2019-02-15 11:26:10,365 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 11:26:10,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:26:10,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 11:26:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-15 11:26:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 11:26:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-15 11:26:10,372 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-02-15 11:26:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:10,372 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-15 11:26:10,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:26:10,373 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-15 11:26:10,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:26:10,373 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:10,373 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:26:10,374 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:10,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:10,374 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-02-15 11:26:10,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:10,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:10,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:10,499 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-15 11:26:10,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:10,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:10,500 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:26:10,500 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-02-15 11:26:10,501 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:10,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:10,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:10,819 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:26:10,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:10,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:10,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:10,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:26:10,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:10,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:10,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:10,973 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:26:10,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:26:10,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:10,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:10,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:10,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:10,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:10,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:11,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:11,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,105 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:11,119 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:11,120 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,201 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,234 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,261 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:11,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:11,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:11,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:11,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:11,611 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,637 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,667 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,692 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,720 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:11,770 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:11,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:11,812 INFO L478 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 97 [2019-02-15 11:26:11,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:11,861 INFO L267 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-15 11:26:11,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:11,975 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-15 11:26:11,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:11,986 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-15 11:26:12,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:12,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:26:12,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:12,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:26:12,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:26:12,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:26:12,007 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-02-15 11:26:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:12,310 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-02-15 11:26:12,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:26:12,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 11:26:12,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:12,313 INFO L225 Difference]: With dead ends: 57 [2019-02-15 11:26:12,313 INFO L226 Difference]: Without dead ends: 56 [2019-02-15 11:26:12,314 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-15 11:26:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-15 11:26:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-02-15 11:26:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 11:26:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-02-15 11:26:12,321 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-02-15 11:26:12,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:12,321 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-02-15 11:26:12,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:26:12,321 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-02-15 11:26:12,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 11:26:12,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:12,322 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 11:26:12,322 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:12,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:12,323 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-02-15 11:26:12,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:12,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:12,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:12,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:12,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:12,388 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-15 11:26:12,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:12,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:12,389 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 11:26:12,390 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-02-15 11:26:12,393 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:12,394 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:12,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:12,695 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:26:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:12,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:12,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:12,695 INFO 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-15 11:26:12,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:12,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:12,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:12,933 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:26:12,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:26:12,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:12,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:13,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:13,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:13,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,045 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:13,057 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:13,059 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,095 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,128 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,210 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,226 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:13,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:13,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:13,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:13,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:13,540 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,576 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,603 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,629 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,654 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:13,703 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:13,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:13,753 INFO L478 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 97 [2019-02-15 11:26:13,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:13,828 INFO L267 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-15 11:26:13,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:13,843 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-15 11:26:13,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:13,868 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-15 11:26:13,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:13,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:26:13,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:13,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:26:13,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:26:13,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:26:13,890 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-02-15 11:26:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:14,309 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-02-15 11:26:14,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:26:14,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 11:26:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:14,312 INFO L225 Difference]: With dead ends: 59 [2019-02-15 11:26:14,312 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 11:26:14,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:26:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 11:26:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-15 11:26:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 11:26:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-02-15 11:26:14,325 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-02-15 11:26:14,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:14,325 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-02-15 11:26:14,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:26:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-02-15 11:26:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:14,326 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:14,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:14,327 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:14,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:14,327 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-02-15 11:26:14,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:14,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:14,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:14,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:14,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:14,411 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-15 11:26:14,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:26:14,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:26:14,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:14,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:26:14,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:26:14,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:26:14,412 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 4 states. [2019-02-15 11:26:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:14,539 INFO L93 Difference]: Finished difference Result 37 states and 114 transitions. [2019-02-15 11:26:14,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:26:14,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:26:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:14,540 INFO L225 Difference]: With dead ends: 37 [2019-02-15 11:26:14,540 INFO L226 Difference]: Without dead ends: 36 [2019-02-15 11:26:14,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:26:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-15 11:26:14,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-02-15 11:26:14,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-15 11:26:14,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2019-02-15 11:26:14,548 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 111 transitions. Word has length 4 [2019-02-15 11:26:14,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:14,548 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 111 transitions. [2019-02-15 11:26:14,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:26:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 111 transitions. [2019-02-15 11:26:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:14,549 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:14,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:14,550 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-02-15 11:26:14,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:14,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:14,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:14,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:14,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:14,657 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-15 11:26:14,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:14,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:14,658 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:14,658 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-02-15 11:26:14,659 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:14,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:14,956 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:14,956 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:26:14,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:14,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:14,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:14,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 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-15 11:26:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:14,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:14,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:15,164 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:26:15,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:15,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:15,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:15,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:15,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:15,407 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,431 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,547 INFO L478 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 24 treesize of output 27 [2019-02-15 11:26:15,552 INFO L478 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 27 treesize of output 33 [2019-02-15 11:26:15,556 INFO L478 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 29 treesize of output 43 [2019-02-15 11:26:15,558 INFO L478 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 31 treesize of output 57 [2019-02-15 11:26:15,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:15,570 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:15,603 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:15,605 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,643 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,674 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,698 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,717 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,733 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,748 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:15,903 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:15,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:15,939 INFO L478 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-15 11:26:15,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:15,984 INFO L267 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-15 11:26:15,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:16,004 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-15 11:26:16,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:16,013 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-15 11:26:16,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:26:16,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 11:26:16,033 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:16,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:26:16,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:26:16,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 11:26:16,034 INFO L87 Difference]: Start difference. First operand 32 states and 111 transitions. Second operand 4 states. [2019-02-15 11:26:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:16,086 INFO L93 Difference]: Finished difference Result 36 states and 122 transitions. [2019-02-15 11:26:16,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:26:16,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:26:16,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:16,090 INFO L225 Difference]: With dead ends: 36 [2019-02-15 11:26:16,090 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 11:26:16,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-15 11:26:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 11:26:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-15 11:26:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-15 11:26:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 121 transitions. [2019-02-15 11:26:16,097 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 121 transitions. Word has length 4 [2019-02-15 11:26:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:16,098 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 121 transitions. [2019-02-15 11:26:16,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:26:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 121 transitions. [2019-02-15 11:26:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:16,099 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:16,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:16,099 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:16,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:16,100 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-02-15 11:26:16,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:16,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:16,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:16,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:16,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:16,176 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-15 11:26:16,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:16,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:16,177 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:16,177 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-02-15 11:26:16,179 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:16,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:16,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:16,609 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:16,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:16,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:16,610 INFO 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-15 11:26:16,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:16,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:16,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:16,852 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:26:16,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:26:16,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:16,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:16,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:16,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:16,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:17,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,010 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:17,021 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:17,022 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,063 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,095 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,120 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,157 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:17,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:17,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:17,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:17,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:17,455 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,484 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,512 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,542 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,572 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,625 INFO L267 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-15 11:26:17,626 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:17,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:17,681 INFO L478 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-15 11:26:17,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:17,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:17,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:18,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:18,050 INFO L478 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 105 [2019-02-15 11:26:18,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:18,105 INFO L267 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-15 11:26:18,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 11:26:18,129 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-15 11:26:18,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:18,153 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-15 11:26:18,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:18,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:18,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:18,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:18,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:18,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:18,174 INFO L87 Difference]: Start difference. First operand 34 states and 121 transitions. Second operand 8 states. [2019-02-15 11:26:18,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:18,741 INFO L93 Difference]: Finished difference Result 79 states and 193 transitions. [2019-02-15 11:26:18,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:18,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:26:18,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:18,744 INFO L225 Difference]: With dead ends: 79 [2019-02-15 11:26:18,744 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 11:26:18,745 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-15 11:26:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 11:26:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2019-02-15 11:26:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 11:26:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-15 11:26:18,754 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-15 11:26:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:18,754 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-15 11:26:18,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-15 11:26:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:18,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:18,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:18,755 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:18,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:18,756 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-02-15 11:26:18,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:18,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:18,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:18,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:18,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:18,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:18,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:18,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:18,868 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:18,868 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-02-15 11:26:18,870 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:18,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:19,253 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:19,253 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:19,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:19,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:19,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:19,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:26:19,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:19,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:19,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:19,439 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:26:19,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:26:19,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:19,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:19,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:19,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:19,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:19,563 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:19,563 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,617 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,700 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,728 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:19,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:19,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:19,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:19,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:19,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:20,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:20,077 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,102 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,128 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,171 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,198 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,248 INFO L267 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-15 11:26:20,249 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:20,549 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-15 11:26:20,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,556 INFO L478 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-15 11:26:20,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:20,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:20,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:20,638 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:20,639 INFO L478 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 106 [2019-02-15 11:26:20,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:20,704 INFO L267 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-15 11:26:20,704 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 11:26:20,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:20,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:20,745 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-15 11:26:20,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:20,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:20,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:20,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:20,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:20,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:20,767 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-15 11:26:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:21,240 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-15 11:26:21,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:21,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:26:21,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:21,242 INFO L225 Difference]: With dead ends: 74 [2019-02-15 11:26:21,242 INFO L226 Difference]: Without dead ends: 73 [2019-02-15 11:26:21,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:21,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-15 11:26:21,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-02-15 11:26:21,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 11:26:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-15 11:26:21,251 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-15 11:26:21,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:21,251 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-15 11:26:21,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:21,251 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-15 11:26:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:21,252 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:21,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:21,252 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:21,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:21,253 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-02-15 11:26:21,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:21,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:21,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:21,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:21,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:21,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:21,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:21,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:21,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:21,384 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-02-15 11:26:21,386 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:21,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:21,714 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:21,715 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:21,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:21,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:21,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:21,715 INFO 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-15 11:26:21,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:21,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:21,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:21,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:21,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:21,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:21,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:21,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:21,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:21,994 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,028 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,318 INFO L478 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 24 treesize of output 27 [2019-02-15 11:26:22,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:22,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:22,331 INFO L478 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 31 treesize of output 57 [2019-02-15 11:26:22,335 INFO L478 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 33 treesize of output 75 [2019-02-15 11:26:22,351 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:22,359 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:22,360 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,398 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,426 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,450 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,466 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,482 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,497 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,650 INFO L267 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-15 11:26:22,650 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:22,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,751 INFO L478 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-15 11:26:22,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:22,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:22,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:22,875 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:22,877 INFO L478 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 106 [2019-02-15 11:26:22,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:22,979 INFO L267 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-15 11:26:22,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 11:26:22,999 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-15 11:26:23,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:23,025 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-15 11:26:23,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:23,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:23,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:23,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:23,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:23,046 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-15 11:26:23,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:23,563 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-15 11:26:23,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:23,563 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:26:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:23,564 INFO L225 Difference]: With dead ends: 74 [2019-02-15 11:26:23,564 INFO L226 Difference]: Without dead ends: 72 [2019-02-15 11:26:23,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:26:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-15 11:26:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2019-02-15 11:26:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 11:26:23,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 149 transitions. [2019-02-15 11:26:23,572 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 149 transitions. Word has length 4 [2019-02-15 11:26:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:23,573 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 149 transitions. [2019-02-15 11:26:23,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 149 transitions. [2019-02-15 11:26:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:23,573 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:23,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:23,574 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:23,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:23,574 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-02-15 11:26:23,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:23,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:23,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:23,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:23,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:23,690 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-15 11:26:23,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:23,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:23,690 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:23,691 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-02-15 11:26:23,692 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:23,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:24,133 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:24,133 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:24,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:24,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:24,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:24,134 INFO 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-15 11:26:24,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:24,152 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:24,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:24,368 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:26:24,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 27 [2019-02-15 11:26:24,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:24,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:24,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:24,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:24,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,500 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:24,510 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:24,511 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,553 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,586 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,611 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,647 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:24,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:24,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:24,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:24,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:24,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:24,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:25,014 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,041 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,067 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,094 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,122 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,170 INFO L267 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-15 11:26:25,171 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:25,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-15 11:26:25,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:25,396 INFO L267 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-15 11:26:25,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:150 [2019-02-15 11:26:25,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,447 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:25,448 INFO L478 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 83 treesize of output 97 [2019-02-15 11:26:25,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:25,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:25,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 142 [2019-02-15 11:26:25,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2019-02-15 11:26:26,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-02-15 11:26:26,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-02-15 11:26:27,043 WARN L181 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-02-15 11:26:27,044 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-15 11:26:27,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:27,075 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-15 11:26:27,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:27,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:26:27,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:27,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:27,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:27,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:26:27,097 INFO L87 Difference]: Start difference. First operand 40 states and 149 transitions. Second operand 8 states. [2019-02-15 11:26:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:36,629 INFO L93 Difference]: Finished difference Result 79 states and 233 transitions. [2019-02-15 11:26:36,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:26:36,630 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:26:36,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:36,631 INFO L225 Difference]: With dead ends: 79 [2019-02-15 11:26:36,631 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 11:26:36,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 11:26:36,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-02-15 11:26:36,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 11:26:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 177 transitions. [2019-02-15 11:26:36,644 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 177 transitions. Word has length 4 [2019-02-15 11:26:36,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:36,644 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 177 transitions. [2019-02-15 11:26:36,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 177 transitions. [2019-02-15 11:26:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:36,645 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:36,645 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:36,646 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:36,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:36,646 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-02-15 11:26:36,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:36,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:36,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:36,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:36,731 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-15 11:26:36,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:26:36,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 11:26:36,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:26:36,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:26:36,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:26:36,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:26:36,733 INFO L87 Difference]: Start difference. First operand 41 states and 177 transitions. Second operand 4 states. [2019-02-15 11:26:36,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:36,807 INFO L93 Difference]: Finished difference Result 53 states and 195 transitions. [2019-02-15 11:26:36,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 11:26:36,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 11:26:36,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:36,809 INFO L225 Difference]: With dead ends: 53 [2019-02-15 11:26:36,809 INFO L226 Difference]: Without dead ends: 52 [2019-02-15 11:26:36,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-15 11:26:36,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-15 11:26:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-02-15 11:26:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-15 11:26:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 186 transitions. [2019-02-15 11:26:36,819 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 186 transitions. Word has length 4 [2019-02-15 11:26:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:36,819 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 186 transitions. [2019-02-15 11:26:36,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:26:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 186 transitions. [2019-02-15 11:26:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:36,820 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:36,820 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:36,820 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash 929876, now seen corresponding path program 1 times [2019-02-15 11:26:36,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:36,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:36,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:36,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:36,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:36,919 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-15 11:26:36,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:36,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:36,919 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:36,920 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [31] [2019-02-15 11:26:36,920 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:36,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:37,177 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:37,178 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:37,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:37,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:37,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:37,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:26:37,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:37,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:37,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:37,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:37,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:37,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:37,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:37,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:37,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:37,471 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:26:37,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:37,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:37,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:37,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:37,630 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:37,637 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:37,638 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,674 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,719 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,742 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,760 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,775 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,790 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:37,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:37,838 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:37,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:37,880 INFO L478 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 97 [2019-02-15 11:26:37,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:38,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:38,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:38,043 INFO L478 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 103 [2019-02-15 11:26:38,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:38,087 INFO L267 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-15 11:26:38,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 11:26:38,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-15 11:26:38,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:38,115 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-15 11:26:38,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:38,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:26:38,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:38,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:38,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:38,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:26:38,134 INFO L87 Difference]: Start difference. First operand 43 states and 186 transitions. Second operand 8 states. [2019-02-15 11:26:38,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:38,635 INFO L93 Difference]: Finished difference Result 87 states and 278 transitions. [2019-02-15 11:26:38,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:26:38,636 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:26:38,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:38,637 INFO L225 Difference]: With dead ends: 87 [2019-02-15 11:26:38,637 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 11:26:38,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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-15 11:26:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 11:26:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 41. [2019-02-15 11:26:38,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-15 11:26:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 149 transitions. [2019-02-15 11:26:38,651 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 149 transitions. Word has length 4 [2019-02-15 11:26:38,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:38,651 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 149 transitions. [2019-02-15 11:26:38,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 149 transitions. [2019-02-15 11:26:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:38,652 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:38,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:38,653 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash 945688, now seen corresponding path program 1 times [2019-02-15 11:26:38,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:38,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:38,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:38,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:38,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:38,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:38,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:38,763 INFO L207 CegarAbsIntRunner]: [0], [22], [32], [33] [2019-02-15 11:26:38,764 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:38,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:38,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:38,953 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:26:38,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:38,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:38,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:38,953 INFO 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-15 11:26:38,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:38,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:38,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:39,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:26:39,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:39,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:39,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:39,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:39,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,086 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:39,157 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:39,158 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,196 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,229 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,255 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,289 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,303 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:39,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:39,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:39,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:39,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:39,576 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,603 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,627 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,653 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,678 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:39,727 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:39,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:39,772 INFO L478 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 97 [2019-02-15 11:26:39,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:39,817 INFO L267 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-15 11:26:39,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:39,834 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-15 11:26:39,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:39,847 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-15 11:26:39,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:39,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:26:39,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:39,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:26:39,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:26:39,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:26:39,867 INFO L87 Difference]: Start difference. First operand 41 states and 149 transitions. Second operand 6 states. [2019-02-15 11:26:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:40,066 INFO L93 Difference]: Finished difference Result 64 states and 185 transitions. [2019-02-15 11:26:40,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:26:40,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 11:26:40,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:40,068 INFO L225 Difference]: With dead ends: 64 [2019-02-15 11:26:40,068 INFO L226 Difference]: Without dead ends: 63 [2019-02-15 11:26:40,069 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-15 11:26:40,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-15 11:26:40,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2019-02-15 11:26:40,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-15 11:26:40,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 157 transitions. [2019-02-15 11:26:40,091 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 157 transitions. Word has length 4 [2019-02-15 11:26:40,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:40,091 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 157 transitions. [2019-02-15 11:26:40,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:26:40,092 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 157 transitions. [2019-02-15 11:26:40,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:40,092 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:40,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:40,093 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:40,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash 945004, now seen corresponding path program 1 times [2019-02-15 11:26:40,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:40,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:40,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:40,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:40,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:40,471 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-02-15 11:26:40,490 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-15 11:26:40,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:40,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:40,491 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:40,491 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [31] [2019-02-15 11:26:40,492 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:40,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:40,774 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:40,774 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:40,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:40,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:40,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:26:40,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:40,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:40,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:40,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:26:40,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:40,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:40,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:40,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:40,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:40,876 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:40,891 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:40,892 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:40,933 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:40,965 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:40,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:41,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:41,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:41,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:41,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:41,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:41,290 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,321 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,347 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,372 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,397 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:41,443 INFO L267 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-15 11:26:41,444 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:43,495 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-15 11:26:43,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,509 INFO L478 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 97 [2019-02-15 11:26:43,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:43,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:43,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:43,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:43,607 INFO L478 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 111 [2019-02-15 11:26:43,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:43,655 INFO L267 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-15 11:26:43,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 11:26:43,675 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-15 11:26:43,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:43,692 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-15 11:26:43,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:43,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:26:43,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:43,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:26:43,719 INFO L87 Difference]: Start difference. First operand 42 states and 157 transitions. Second operand 8 states. [2019-02-15 11:26:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:44,655 INFO L93 Difference]: Finished difference Result 98 states and 268 transitions. [2019-02-15 11:26:44,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:26:44,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:26:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:44,656 INFO L225 Difference]: With dead ends: 98 [2019-02-15 11:26:44,656 INFO L226 Difference]: Without dead ends: 97 [2019-02-15 11:26:44,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 11:26:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-15 11:26:44,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 47. [2019-02-15 11:26:44,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-15 11:26:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 197 transitions. [2019-02-15 11:26:44,670 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 197 transitions. Word has length 4 [2019-02-15 11:26:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:44,671 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 197 transitions. [2019-02-15 11:26:44,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 197 transitions. [2019-02-15 11:26:44,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:44,671 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:44,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:44,672 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:44,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:44,672 INFO L82 PathProgramCache]: Analyzing trace with hash 945500, now seen corresponding path program 1 times [2019-02-15 11:26:44,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:44,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:44,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:44,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:44,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:44,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:44,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:44,764 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:44,765 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [31] [2019-02-15 11:26:44,766 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:44,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:44,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:44,990 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:44,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:44,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:44,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:44,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 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-15 11:26:45,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:45,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:45,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:45,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:26:45,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:45,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:45,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:45,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:45,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,094 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:45,115 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:45,116 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,156 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,186 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,212 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,247 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:45,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:45,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:45,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:45,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:45,504 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,528 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,553 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,579 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,607 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,659 INFO L267 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-15 11:26:45,660 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:45,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,730 INFO L478 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 97 [2019-02-15 11:26:45,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:45,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:45,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:45,802 INFO L478 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 111 [2019-02-15 11:26:45,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:45,851 INFO L267 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-15 11:26:45,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 11:26:46,067 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-02-15 11:26:46,068 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-15 11:26:46,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:46,486 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-15 11:26:46,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:46,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:46,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:46,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:46,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:46,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:46,548 INFO L87 Difference]: Start difference. First operand 47 states and 197 transitions. Second operand 8 states. [2019-02-15 11:26:47,180 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-02-15 11:26:47,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:47,857 INFO L93 Difference]: Finished difference Result 91 states and 282 transitions. [2019-02-15 11:26:47,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:47,858 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:26:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:47,859 INFO L225 Difference]: With dead ends: 91 [2019-02-15 11:26:47,859 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 11:26:47,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 11:26:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2019-02-15 11:26:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-15 11:26:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 243 transitions. [2019-02-15 11:26:47,872 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 243 transitions. Word has length 4 [2019-02-15 11:26:47,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:47,872 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 243 transitions. [2019-02-15 11:26:47,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:47,872 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 243 transitions. [2019-02-15 11:26:47,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:47,873 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:47,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:47,873 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:47,874 INFO L82 PathProgramCache]: Analyzing trace with hash 933968, now seen corresponding path program 1 times [2019-02-15 11:26:47,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:47,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:47,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:47,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:47,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:47,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:47,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:47,956 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:47,957 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [31] [2019-02-15 11:26:47,957 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:47,957 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:48,179 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:48,179 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:48,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:48,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:48,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:48,180 INFO 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-15 11:26:48,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:48,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:48,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:48,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:48,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:48,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:48,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:48,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:48,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:48,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,470 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,522 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,583 INFO L478 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 24 treesize of output 27 [2019-02-15 11:26:48,587 INFO L478 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 27 treesize of output 33 [2019-02-15 11:26:48,589 INFO L478 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 29 treesize of output 43 [2019-02-15 11:26:48,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:48,596 INFO L478 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 33 treesize of output 75 [2019-02-15 11:26:48,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:48,606 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:48,606 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,642 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,681 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,703 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,721 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,735 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,748 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:48,794 INFO L267 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-15 11:26:48,795 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:49,030 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-15 11:26:49,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,051 INFO L478 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 97 [2019-02-15 11:26:49,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:26:49,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:26:49,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:49,127 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:49,128 INFO L478 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 112 [2019-02-15 11:26:49,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:49,175 INFO L267 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-15 11:26:49,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-15 11:26:49,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:49,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:26:49,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:49,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:26:49,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:49,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:49,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:49,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:26:49,238 INFO L87 Difference]: Start difference. First operand 56 states and 243 transitions. Second operand 8 states. [2019-02-15 11:26:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:26:49,654 INFO L93 Difference]: Finished difference Result 92 states and 291 transitions. [2019-02-15 11:26:49,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:26:49,655 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:26:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:26:49,656 INFO L225 Difference]: With dead ends: 92 [2019-02-15 11:26:49,656 INFO L226 Difference]: Without dead ends: 90 [2019-02-15 11:26:49,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:26:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-15 11:26:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2019-02-15 11:26:49,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 11:26:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 254 transitions. [2019-02-15 11:26:49,672 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 254 transitions. Word has length 4 [2019-02-15 11:26:49,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:26:49,672 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 254 transitions. [2019-02-15 11:26:49,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:26:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 254 transitions. [2019-02-15 11:26:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:26:49,673 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:26:49,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:26:49,674 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:26:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash 949406, now seen corresponding path program 1 times [2019-02-15 11:26:49,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:26:49,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:49,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:49,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:26:49,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:26:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:49,808 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-15 11:26:49,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:49,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:26:49,809 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:26:49,809 INFO L207 CegarAbsIntRunner]: [0], [26], [28], [31] [2019-02-15 11:26:49,812 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:26:49,812 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:26:50,180 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:26:50,181 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:26:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:26:50,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:26:50,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:26:50,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:26:50,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:26:50,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:26:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:26:50,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:26:50,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:26:50,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:26:50,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:26:50,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:26:50,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:26:50,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,358 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:26:50,371 INFO L478 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 37 treesize of output 96 [2019-02-15 11:26:50,372 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,431 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,463 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,487 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:26:50,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:26:50,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:26:50,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:26:50,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:50,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:26:50,796 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,821 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,845 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,870 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,895 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:26:50,941 INFO L267 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-15 11:26:50,942 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:26:51,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:51,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 106 [2019-02-15 11:26:51,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:26:51,224 INFO L267 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-15 11:26:51,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:150 [2019-02-15 11:26:51,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:51,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:51,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:51,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:51,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:51,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:51,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:51,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:51,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:51,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 142 [2019-02-15 11:26:51,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-15 11:26:52,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:26:52,249 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:26:52,250 INFO L478 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 83 treesize of output 97 [2019-02-15 11:26:52,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:26:52,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-02-15 11:26:52,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-02-15 11:26:55,701 WARN L181 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-02-15 11:26:55,702 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-15 11:26:55,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:26:55,731 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-15 11:26:55,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:26:55,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:26:55,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:26:55,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:26:55,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:26:55,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:26:55,751 INFO L87 Difference]: Start difference. First operand 59 states and 254 transitions. Second operand 8 states. [2019-02-15 11:27:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:07,293 INFO L93 Difference]: Finished difference Result 101 states and 344 transitions. [2019-02-15 11:27:07,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:07,293 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:27:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:07,295 INFO L225 Difference]: With dead ends: 101 [2019-02-15 11:27:07,295 INFO L226 Difference]: Without dead ends: 100 [2019-02-15 11:27:07,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=44, Invalid=65, Unknown=1, NotChecked=0, Total=110 [2019-02-15 11:27:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-15 11:27:07,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 63. [2019-02-15 11:27:07,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-15 11:27:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 286 transitions. [2019-02-15 11:27:07,313 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 286 transitions. Word has length 4 [2019-02-15 11:27:07,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:07,314 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 286 transitions. [2019-02-15 11:27:07,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 286 transitions. [2019-02-15 11:27:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:27:07,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:07,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:27:07,315 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:07,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:07,315 INFO L82 PathProgramCache]: Analyzing trace with hash 951454, now seen corresponding path program 1 times [2019-02-15 11:27:07,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:07,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:07,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:07,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:07,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:07,372 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-15 11:27:07,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:07,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:07,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:27:07,373 INFO L207 CegarAbsIntRunner]: [0], [28], [32], [33] [2019-02-15 11:27:07,374 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:07,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:08,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:08,939 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:27:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:08,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:08,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:08,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:27:08,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:08,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:08,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:09,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:27:09,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:27:09,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:27:09,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:27:09,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,280 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:27:09,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-15 11:27:09,389 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,438 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,496 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 27 [2019-02-15 11:27:09,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:09,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:09,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:09,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:09,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:09,721 INFO L478 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 37 treesize of output 120 [2019-02-15 11:27:09,721 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,779 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,807 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,829 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,845 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,860 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,873 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:09,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:09,937 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-02-15 11:27:09,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:09,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-02-15 11:27:09,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:10,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:10,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-15 11:27:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:10,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:10,088 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-15 11:27:10,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:10,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:27:10,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:10,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:27:10,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:27:10,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:27:10,108 INFO L87 Difference]: Start difference. First operand 63 states and 286 transitions. Second operand 6 states. [2019-02-15 11:27:10,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:10,358 INFO L93 Difference]: Finished difference Result 86 states and 322 transitions. [2019-02-15 11:27:10,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:27:10,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 11:27:10,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:10,360 INFO L225 Difference]: With dead ends: 86 [2019-02-15 11:27:10,360 INFO L226 Difference]: Without dead ends: 85 [2019-02-15 11:27:10,361 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-15 11:27:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-15 11:27:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2019-02-15 11:27:10,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-15 11:27:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 294 transitions. [2019-02-15 11:27:10,373 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 294 transitions. Word has length 4 [2019-02-15 11:27:10,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:10,374 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 294 transitions. [2019-02-15 11:27:10,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:27:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 294 transitions. [2019-02-15 11:27:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:27:10,375 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:10,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:27:10,375 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:10,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:10,375 INFO L82 PathProgramCache]: Analyzing trace with hash 951266, now seen corresponding path program 2 times [2019-02-15 11:27:10,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:10,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:10,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:10,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:10,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:10,788 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2019-02-15 11:27:10,960 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-15 11:27:11,103 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-15 11:27:11,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:11,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:11,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:27:11,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:27:11,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:11,104 INFO 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-15 11:27:11,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:27:11,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:27:11,136 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 11:27:11,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:27:11,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:11,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 27 [2019-02-15 11:27:11,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:11,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:11,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:11,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:11,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:11,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,263 INFO L478 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 37 treesize of output 120 [2019-02-15 11:27:11,264 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,319 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,350 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:27:11,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:27:11,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:27:11,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:27:11,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,700 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:27:11,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:11,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-15 11:27:11,798 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,836 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,874 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,912 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,950 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:11,989 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:12,054 INFO L267 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-15 11:27:12,054 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 11:27:12,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-02-15 11:27:12,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:12,161 INFO L267 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-15 11:27:12,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 11:27:12,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:12,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 140 [2019-02-15 11:27:12,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:12,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:12,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:76 [2019-02-15 11:27:12,291 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-15 11:27:12,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:12,307 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-15 11:27:12,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:12,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:27:12,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:12,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:12,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:12,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:27:12,326 INFO L87 Difference]: Start difference. First operand 64 states and 294 transitions. Second operand 8 states. [2019-02-15 11:27:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:12,898 INFO L93 Difference]: Finished difference Result 119 states and 384 transitions. [2019-02-15 11:27:12,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:27:12,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 11:27:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:12,900 INFO L225 Difference]: With dead ends: 119 [2019-02-15 11:27:12,900 INFO L226 Difference]: Without dead ends: 115 [2019-02-15 11:27:12,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-15 11:27:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 67. [2019-02-15 11:27:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-15 11:27:12,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 286 transitions. [2019-02-15 11:27:12,922 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 286 transitions. Word has length 4 [2019-02-15 11:27:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:12,922 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 286 transitions. [2019-02-15 11:27:12,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:12,922 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 286 transitions. [2019-02-15 11:27:12,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 11:27:12,923 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:12,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 11:27:12,923 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:12,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:12,924 INFO L82 PathProgramCache]: Analyzing trace with hash 938000, now seen corresponding path program 1 times [2019-02-15 11:27:12,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:12,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:12,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:27:12,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:12,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:13,035 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-15 11:27:13,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:13,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:13,035 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 11:27:13,035 INFO L207 CegarAbsIntRunner]: [0], [14], [32], [33] [2019-02-15 11:27:13,036 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:13,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:13,251 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:13,251 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:27:13,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:13,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:13,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:13,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:27:13,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:13,260 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:13,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:13,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 27 [2019-02-15 11:27:13,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:13,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:13,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:13,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:13,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,352 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:13,367 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:13,367 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,406 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,438 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,461 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,481 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,498 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:13,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:13,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:13,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:13,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,752 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:13,752 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,777 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,801 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,826 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,851 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:13,898 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:13,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:13,932 INFO L478 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 97 [2019-02-15 11:27:13,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:13,975 INFO L267 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-15 11:27:13,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:13,995 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-15 11:27:13,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:14,006 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-15 11:27:14,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:14,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:27:14,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:14,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:27:14,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:27:14,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:27:14,025 INFO L87 Difference]: Start difference. First operand 67 states and 286 transitions. Second operand 6 states. [2019-02-15 11:27:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:14,487 INFO L93 Difference]: Finished difference Result 90 states and 322 transitions. [2019-02-15 11:27:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:27:14,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 11:27:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:14,490 INFO L225 Difference]: With dead ends: 90 [2019-02-15 11:27:14,490 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 11:27:14,491 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-15 11:27:14,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 11:27:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-02-15 11:27:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-15 11:27:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 294 transitions. [2019-02-15 11:27:14,508 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 294 transitions. Word has length 4 [2019-02-15 11:27:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:14,509 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 294 transitions. [2019-02-15 11:27:14,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:27:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 294 transitions. [2019-02-15 11:27:14,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:14,510 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:14,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:14,510 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:14,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:14,510 INFO L82 PathProgramCache]: Analyzing trace with hash 29197230, now seen corresponding path program 1 times [2019-02-15 11:27:14,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:14,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:14,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:14,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:14,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:14,683 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-02-15 11:27:14,723 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-15 11:27:14,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:14,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:14,724 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:14,724 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [34], [35] [2019-02-15 11:27:14,727 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:14,727 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:14,953 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:14,953 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:27:14,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:14,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:14,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:14,953 INFO 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-15 11:27:14,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:14,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:14,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:14,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:15,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2019-02-15 11:27:15,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2019-02-15 11:27:15,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2019-02-15 11:27:15,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 72 [2019-02-15 11:27:15,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2019-02-15 11:27:15,152 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,173 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,219 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:27:15,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:15,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-15 11:27:15,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-15 11:27:15,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-15 11:27:15,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-15 11:27:15,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-15 11:27:15,306 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,340 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,364 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,383 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,397 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,412 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,425 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:15,466 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:84, output treesize:88 [2019-02-15 11:27:15,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:15,506 INFO L478 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 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-15 11:27:15,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:15,542 INFO L267 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-15 11:27:15,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:63 [2019-02-15 11:27:15,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:15,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:15,575 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-15 11:27:15,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:15,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 6 [2019-02-15 11:27:15,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:15,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:27:15,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:27:15,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:27:15,594 INFO L87 Difference]: Start difference. First operand 68 states and 294 transitions. Second operand 7 states. [2019-02-15 11:27:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:15,883 INFO L93 Difference]: Finished difference Result 77 states and 308 transitions. [2019-02-15 11:27:15,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:27:15,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-15 11:27:15,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:15,885 INFO L225 Difference]: With dead ends: 77 [2019-02-15 11:27:15,885 INFO L226 Difference]: Without dead ends: 76 [2019-02-15 11:27:15,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:27:15,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-15 11:27:15,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-02-15 11:27:15,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-15 11:27:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 301 transitions. [2019-02-15 11:27:15,902 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 301 transitions. Word has length 5 [2019-02-15 11:27:15,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:15,902 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 301 transitions. [2019-02-15 11:27:15,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:27:15,902 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 301 transitions. [2019-02-15 11:27:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:15,903 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:15,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:15,903 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:15,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:15,903 INFO L82 PathProgramCache]: Analyzing trace with hash 29172180, now seen corresponding path program 1 times [2019-02-15 11:27:15,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:15,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:15,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:15,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:15,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:15,992 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-15 11:27:15,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:15,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:15,993 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:15,993 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [32], [33] [2019-02-15 11:27:15,994 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:15,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:16,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:16,321 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:16,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:16,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:16,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:16,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:27:16,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:16,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:16,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:16,501 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:27:16,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:27:16,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:16,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:16,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:16,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:16,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:16,548 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:16,549 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:16,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:16,621 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:16,646 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:16,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:16,682 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:16,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:16,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:16,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:16,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:16,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:16,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:16,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:16,943 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:16,968 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:16,992 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:17,017 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:17,042 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:17,092 INFO L267 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-15 11:27:17,092 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:17,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:17,151 INFO L478 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-15 11:27:17,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:17,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:17,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:17,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:17,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:17,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:17,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:17,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:17,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:17,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:17,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:17,259 INFO L478 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 113 [2019-02-15 11:27:17,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:17,303 INFO L267 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-15 11:27:17,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 11:27:17,324 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-15 11:27:17,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:17,345 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-15 11:27:17,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:17,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:27:17,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:17,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:17,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:17,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:17,364 INFO L87 Difference]: Start difference. First operand 69 states and 301 transitions. Second operand 8 states. [2019-02-15 11:27:17,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:17,804 INFO L93 Difference]: Finished difference Result 102 states and 353 transitions. [2019-02-15 11:27:17,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:27:17,804 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:27:17,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:17,805 INFO L225 Difference]: With dead ends: 102 [2019-02-15 11:27:17,806 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 11:27:17,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:17,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 11:27:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2019-02-15 11:27:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-15 11:27:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 317 transitions. [2019-02-15 11:27:17,829 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 317 transitions. Word has length 5 [2019-02-15 11:27:17,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:17,830 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 317 transitions. [2019-02-15 11:27:17,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:17,830 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 317 transitions. [2019-02-15 11:27:17,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:17,830 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:17,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:17,831 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:17,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:17,831 INFO L82 PathProgramCache]: Analyzing trace with hash 29171496, now seen corresponding path program 1 times [2019-02-15 11:27:17,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:17,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:17,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:17,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:17,993 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 11:27:18,029 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-15 11:27:18,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:18,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:18,029 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:18,029 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [31] [2019-02-15 11:27:18,031 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:18,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:18,348 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:18,349 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:18,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:18,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:18,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:18,349 INFO 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-15 11:27:18,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:18,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:18,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:18,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:18,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:18,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:18,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:18,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:18,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:18,609 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,743 INFO L478 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 24 treesize of output 27 [2019-02-15 11:27:18,746 INFO L478 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 27 treesize of output 33 [2019-02-15 11:27:18,748 INFO L478 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 29 treesize of output 43 [2019-02-15 11:27:18,750 INFO L478 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 31 treesize of output 57 [2019-02-15 11:27:18,753 INFO L478 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 33 treesize of output 75 [2019-02-15 11:27:18,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:18,774 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:18,774 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,810 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,838 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,860 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,879 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,894 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,907 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:18,953 INFO L267 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-15 11:27:18,954 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:19,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,002 INFO L478 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-15 11:27:19,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:19,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:19,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:19,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,083 INFO L478 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 113 [2019-02-15 11:27:19,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:19,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:19,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:27:19,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,174 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:19,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:19,176 INFO L478 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 122 [2019-02-15 11:27:19,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:19,225 INFO L267 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-15 11:27:19,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 11:27:19,244 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-15 11:27:19,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:19,270 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-15 11:27:19,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:19,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:27:19,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:19,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:19,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:19,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:19,289 INFO L87 Difference]: Start difference. First operand 71 states and 317 transitions. Second operand 10 states. [2019-02-15 11:27:20,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:20,884 INFO L93 Difference]: Finished difference Result 147 states and 540 transitions. [2019-02-15 11:27:20,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:27:20,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:27:20,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:20,887 INFO L225 Difference]: With dead ends: 147 [2019-02-15 11:27:20,887 INFO L226 Difference]: Without dead ends: 146 [2019-02-15 11:27:20,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:20,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-15 11:27:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2019-02-15 11:27:20,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-15 11:27:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 464 transitions. [2019-02-15 11:27:20,917 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 464 transitions. Word has length 5 [2019-02-15 11:27:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:20,917 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 464 transitions. [2019-02-15 11:27:20,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 464 transitions. [2019-02-15 11:27:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:20,918 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:20,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:20,918 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:20,919 INFO L82 PathProgramCache]: Analyzing trace with hash 29187556, now seen corresponding path program 1 times [2019-02-15 11:27:20,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:20,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:20,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:20,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:20,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:20,975 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-15 11:27:20,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:20,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:20,975 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:20,976 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [32], [33] [2019-02-15 11:27:20,976 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:20,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:21,307 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:21,308 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:21,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:21,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:21,308 INFO 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-15 11:27:21,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:21,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:21,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:21,506 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:27:21,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:27:21,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:21,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:21,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:21,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:21,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,540 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:21,551 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:21,552 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,595 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,626 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,650 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,670 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:21,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:21,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:21,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:21,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:21,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:21,961 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:21,986 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,010 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,035 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,060 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,107 INFO L267 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-15 11:27:22,107 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:22,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,148 INFO L478 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-15 11:27:22,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:22,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:22,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:22,281 INFO L478 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 105 [2019-02-15 11:27:22,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:22,326 INFO L267 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-15 11:27:22,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 11:27:22,346 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-15 11:27:22,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:22,366 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-15 11:27:22,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:22,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:27:22,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:22,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:22,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:22,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:22,386 INFO L87 Difference]: Start difference. First operand 89 states and 464 transitions. Second operand 8 states. [2019-02-15 11:27:22,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:22,787 INFO L93 Difference]: Finished difference Result 128 states and 531 transitions. [2019-02-15 11:27:22,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:27:22,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:27:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:22,789 INFO L225 Difference]: With dead ends: 128 [2019-02-15 11:27:22,790 INFO L226 Difference]: Without dead ends: 127 [2019-02-15 11:27:22,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-15 11:27:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2019-02-15 11:27:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-15 11:27:22,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 488 transitions. [2019-02-15 11:27:22,822 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 488 transitions. Word has length 5 [2019-02-15 11:27:22,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:22,822 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 488 transitions. [2019-02-15 11:27:22,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:22,822 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 488 transitions. [2019-02-15 11:27:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:22,823 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:22,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:22,823 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:22,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:22,823 INFO L82 PathProgramCache]: Analyzing trace with hash 29187368, now seen corresponding path program 1 times [2019-02-15 11:27:22,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:22,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:22,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:22,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:22,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:23,006 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-02-15 11:27:23,043 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-15 11:27:23,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:23,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:23,043 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:23,043 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [31] [2019-02-15 11:27:23,044 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:23,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:23,344 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:23,344 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:23,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:23,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:23,345 INFO 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-15 11:27:23,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:23,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:23,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:23,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:27:23,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:23,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:23,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:23,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:23,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:23,453 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:23,453 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,491 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,522 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,580 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:23,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:23,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:23,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:23,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:23,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:23,833 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,858 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,882 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,907 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,932 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:23,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:23,978 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:24,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,039 INFO L478 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-15 11:27:24,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:24,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:24,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,144 INFO L478 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 105 [2019-02-15 11:27:24,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:24,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:27:24,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,225 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:24,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:24,227 INFO L478 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 118 [2019-02-15 11:27:24,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:24,275 INFO L267 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-15 11:27:24,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 11:27:24,297 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-15 11:27:24,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:24,352 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-15 11:27:24,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:24,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:24,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:24,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:24,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:24,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:24,371 INFO L87 Difference]: Start difference. First operand 92 states and 488 transitions. Second operand 10 states. [2019-02-15 11:27:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:25,087 INFO L93 Difference]: Finished difference Result 146 states and 591 transitions. [2019-02-15 11:27:25,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:25,088 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:27:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:25,090 INFO L225 Difference]: With dead ends: 146 [2019-02-15 11:27:25,090 INFO L226 Difference]: Without dead ends: 144 [2019-02-15 11:27:25,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:27:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-02-15 11:27:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2019-02-15 11:27:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-15 11:27:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 536 transitions. [2019-02-15 11:27:25,128 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 536 transitions. Word has length 5 [2019-02-15 11:27:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:25,129 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 536 transitions. [2019-02-15 11:27:25,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 536 transitions. [2019-02-15 11:27:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:25,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:25,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:25,130 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:25,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:25,130 INFO L82 PathProgramCache]: Analyzing trace with hash 29175836, now seen corresponding path program 1 times [2019-02-15 11:27:25,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:25,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:25,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:25,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:25,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:25,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:25,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:25,252 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:25,252 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [26], [31] [2019-02-15 11:27:25,254 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:25,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:25,555 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:25,555 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:25,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:25,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:25,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:25,556 INFO 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-15 11:27:25,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:25,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:25,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:25,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:27:25,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:25,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:25,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:25,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:25,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:25,651 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:25,652 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,693 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,725 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,750 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:25,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:25,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:25,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:25,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:25,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:26,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:26,046 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,072 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,096 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,122 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,147 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:26,194 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:26,640 WARN L181 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-15 11:27:26,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,646 INFO L478 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-15 11:27:26,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:26,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:26,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,719 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:26,719 INFO L478 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 106 [2019-02-15 11:27:26,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:26,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-02-15 11:27:26,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:26,800 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:26,801 INFO L478 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 108 [2019-02-15 11:27:26,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:26,845 INFO L267 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-15 11:27:26,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-02-15 11:27:26,872 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-15 11:27:26,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:26,923 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-15 11:27:26,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:26,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:26,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:26,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:26,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:26,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:26,943 INFO L87 Difference]: Start difference. First operand 98 states and 536 transitions. Second operand 10 states. [2019-02-15 11:27:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:27,903 INFO L93 Difference]: Finished difference Result 140 states and 582 transitions. [2019-02-15 11:27:27,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:27,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:27:27,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:27,906 INFO L225 Difference]: With dead ends: 140 [2019-02-15 11:27:27,906 INFO L226 Difference]: Without dead ends: 138 [2019-02-15 11:27:27,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:27:27,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-15 11:27:27,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2019-02-15 11:27:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-15 11:27:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 486 transitions. [2019-02-15 11:27:27,940 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 486 transitions. Word has length 5 [2019-02-15 11:27:27,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:27,941 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 486 transitions. [2019-02-15 11:27:27,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 486 transitions. [2019-02-15 11:27:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:27,941 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:27,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:27,941 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:27,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:27,942 INFO L82 PathProgramCache]: Analyzing trace with hash 29191274, now seen corresponding path program 1 times [2019-02-15 11:27:27,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:27,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:27,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:27,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:27,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:28,118 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-15 11:27:28,159 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-15 11:27:28,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:28,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:28,159 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:28,159 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [28], [31] [2019-02-15 11:27:28,161 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:28,161 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:28,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:28,458 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:28,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:28,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:28,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:28,459 INFO 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-15 11:27:28,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:28,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:28,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:28,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:28,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:28,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:28,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:28,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:28,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:28,722 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,745 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,858 INFO L478 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 24 treesize of output 27 [2019-02-15 11:27:28,861 INFO L478 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 27 treesize of output 33 [2019-02-15 11:27:28,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:28,867 INFO L478 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 31 treesize of output 57 [2019-02-15 11:27:28,870 INFO L478 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 33 treesize of output 75 [2019-02-15 11:27:28,891 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:28,903 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:28,904 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,950 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:28,979 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:29,000 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:29,018 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:29,031 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:29,045 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:29,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:29,091 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:29,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-15 11:27:29,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:27:29,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:27:29,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-15 11:27:29,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,355 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:29,355 INFO L478 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 83 treesize of output 112 [2019-02-15 11:27:29,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:29,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,471 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:29,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 131 [2019-02-15 11:27:29,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-15 11:27:29,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-15 11:27:29,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:185 [2019-02-15 11:27:29,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:29,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 136 [2019-02-15 11:27:29,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 11:27:30,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:30,293 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:30,294 INFO L478 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 73 treesize of output 105 [2019-02-15 11:27:30,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:30,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-15 11:27:30,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-15 11:27:30,893 WARN L181 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-15 11:27:30,894 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-15 11:27:30,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:30,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:30,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:27:30,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:30,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:30,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:30,968 INFO L87 Difference]: Start difference. First operand 92 states and 486 transitions. Second operand 10 states. [2019-02-15 11:27:33,298 WARN L181 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-02-15 11:27:37,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:37,362 INFO L93 Difference]: Finished difference Result 155 states and 683 transitions. [2019-02-15 11:27:37,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:27:37,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:27:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:37,364 INFO L225 Difference]: With dead ends: 155 [2019-02-15 11:27:37,365 INFO L226 Difference]: Without dead ends: 154 [2019-02-15 11:27:37,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:27:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-15 11:27:37,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 98. [2019-02-15 11:27:37,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-15 11:27:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 534 transitions. [2019-02-15 11:27:37,399 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 534 transitions. Word has length 5 [2019-02-15 11:27:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:37,399 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 534 transitions. [2019-02-15 11:27:37,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:37,399 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 534 transitions. [2019-02-15 11:27:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:37,400 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:37,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:37,400 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:37,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:37,401 INFO L82 PathProgramCache]: Analyzing trace with hash 29193322, now seen corresponding path program 1 times [2019-02-15 11:27:37,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:37,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:37,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:37,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:37,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:37,577 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-15 11:27:37,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:37,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:37,577 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:37,578 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [32], [33] [2019-02-15 11:27:37,578 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:37,578 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:37,842 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:37,842 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:37,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:37,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:37,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:27:37,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:37,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:37,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:37,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:27:37,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:37,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:27:37,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:27:38,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:27:38,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,281 INFO L303 Elim1Store]: Index analysis took 146 ms [2019-02-15 11:27:38,281 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:27:38,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-15 11:27:38,380 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,419 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,458 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 27 [2019-02-15 11:27:38,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:38,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:38,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:38,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:38,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:38,650 INFO L478 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 37 treesize of output 120 [2019-02-15 11:27:38,651 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,701 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,729 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,751 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,769 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,783 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,797 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,861 INFO L267 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-15 11:27:38,862 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 11:27:38,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-15 11:27:38,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:38,949 INFO L267 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-15 11:27:38,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 11:27:38,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:38,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-02-15 11:27:38,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:39,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:39,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-15 11:27:39,075 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-15 11:27:39,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:39,096 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-15 11:27:39,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:39,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:27:39,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:39,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:39,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:39,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:39,115 INFO L87 Difference]: Start difference. First operand 98 states and 534 transitions. Second operand 8 states. [2019-02-15 11:27:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:39,717 INFO L93 Difference]: Finished difference Result 137 states and 601 transitions. [2019-02-15 11:27:39,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:27:39,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:27:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:39,720 INFO L225 Difference]: With dead ends: 137 [2019-02-15 11:27:39,720 INFO L226 Difference]: Without dead ends: 132 [2019-02-15 11:27:39,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-02-15 11:27:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2019-02-15 11:27:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-15 11:27:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 556 transitions. [2019-02-15 11:27:39,762 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 556 transitions. Word has length 5 [2019-02-15 11:27:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:39,762 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 556 transitions. [2019-02-15 11:27:39,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 556 transitions. [2019-02-15 11:27:39,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:39,762 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:39,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:39,763 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:39,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:39,763 INFO L82 PathProgramCache]: Analyzing trace with hash 29193134, now seen corresponding path program 2 times [2019-02-15 11:27:39,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:39,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:39,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:39,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:39,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:39,835 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-15 11:27:39,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:39,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:39,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:27:39,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:27:39,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:39,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 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-15 11:27:39,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:27:39,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:27:39,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:27:39,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:27:39,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:39,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:27:39,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:27:39,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:39,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:27:40,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:27:40,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,125 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:27:40,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-15 11:27:40,225 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,263 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,302 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,341 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,382 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 27 [2019-02-15 11:27:40,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:40,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:40,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:40,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:40,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:40,496 INFO L478 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 37 treesize of output 120 [2019-02-15 11:27:40,497 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,546 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,574 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,596 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,614 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,629 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,642 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:40,713 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-15 11:27:40,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-15 11:27:40,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:40,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-15 11:27:40,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-02-15 11:27:40,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:40,921 INFO L267 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-15 11:27:40,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-15 11:27:40,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,956 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,962 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:40,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:40,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 151 [2019-02-15 11:27:40,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:41,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:41,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-02-15 11:27:41,055 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-15 11:27:41,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:41,097 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-15 11:27:41,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:41,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:41,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:41,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:41,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:41,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:41,116 INFO L87 Difference]: Start difference. First operand 100 states and 556 transitions. Second operand 10 states. [2019-02-15 11:27:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:41,860 INFO L93 Difference]: Finished difference Result 154 states and 681 transitions. [2019-02-15 11:27:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:41,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:27:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:41,863 INFO L225 Difference]: With dead ends: 154 [2019-02-15 11:27:41,863 INFO L226 Difference]: Without dead ends: 152 [2019-02-15 11:27:41,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:27:41,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-15 11:27:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 109. [2019-02-15 11:27:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-15 11:27:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 628 transitions. [2019-02-15 11:27:41,921 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 628 transitions. Word has length 5 [2019-02-15 11:27:41,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:41,921 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 628 transitions. [2019-02-15 11:27:41,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 628 transitions. [2019-02-15 11:27:41,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:41,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:41,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:41,923 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:41,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:41,923 INFO L82 PathProgramCache]: Analyzing trace with hash 29179868, now seen corresponding path program 1 times [2019-02-15 11:27:41,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:41,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:41,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:27:41,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:41,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:42,162 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-15 11:27:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:42,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:42,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:42,174 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:42,174 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [32], [33] [2019-02-15 11:27:42,175 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:42,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:42,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:42,395 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:42,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:42,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:42,396 INFO 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-15 11:27:42,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:42,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:42,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:42,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:42,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:42,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:42,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:42,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:42,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:42,661 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,686 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,738 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:27:42,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:42,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:42,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:42,809 INFO L478 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 33 treesize of output 75 [2019-02-15 11:27:42,813 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:42,819 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:42,820 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,868 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,896 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,918 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,935 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,949 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:42,963 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:43,009 INFO L267 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-15 11:27:43,009 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:43,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,055 INFO L478 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-15 11:27:43,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:43,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:43,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:43,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:43,124 INFO L478 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 113 [2019-02-15 11:27:43,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:43,171 INFO L267 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-15 11:27:43,171 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 11:27:43,191 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-15 11:27:43,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:43,211 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-15 11:27:43,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:43,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:27:43,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:43,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:43,230 INFO L87 Difference]: Start difference. First operand 109 states and 628 transitions. Second operand 8 states. [2019-02-15 11:27:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:43,659 INFO L93 Difference]: Finished difference Result 140 states and 686 transitions. [2019-02-15 11:27:43,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:27:43,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:27:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:43,661 INFO L225 Difference]: With dead ends: 140 [2019-02-15 11:27:43,661 INFO L226 Difference]: Without dead ends: 139 [2019-02-15 11:27:43,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:43,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-15 11:27:43,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2019-02-15 11:27:43,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-15 11:27:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 652 transitions. [2019-02-15 11:27:43,712 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 652 transitions. Word has length 5 [2019-02-15 11:27:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:43,713 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 652 transitions. [2019-02-15 11:27:43,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 652 transitions. [2019-02-15 11:27:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:43,713 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:43,713 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:43,714 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:43,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:43,714 INFO L82 PathProgramCache]: Analyzing trace with hash 29179680, now seen corresponding path program 1 times [2019-02-15 11:27:43,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:43,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:43,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:43,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:43,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:43,868 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-02-15 11:27:43,911 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-15 11:27:43,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:43,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:43,912 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:43,912 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [26], [31] [2019-02-15 11:27:43,913 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:43,913 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:44,232 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:44,232 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:44,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:44,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:44,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:27:44,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:44,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:44,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:44,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:27:44,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:44,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:44,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:44,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:44,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,320 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:44,336 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:44,336 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,375 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,406 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,431 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,451 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,478 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:44,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:44,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:44,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:44,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:44,732 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,757 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,781 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,806 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,831 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:44,877 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:44,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:44,936 INFO L478 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-15 11:27:44,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:44,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:44,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:45,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,014 INFO L478 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 113 [2019-02-15 11:27:45,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:45,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:45,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:27:45,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,097 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:45,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:45,099 INFO L478 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 122 [2019-02-15 11:27:45,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:45,148 INFO L267 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-15 11:27:45,148 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 11:27:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:45,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:45,208 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-15 11:27:45,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:45,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:45,226 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:45,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:45,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:45,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:45,227 INFO L87 Difference]: Start difference. First operand 112 states and 652 transitions. Second operand 10 states. [2019-02-15 11:27:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:45,891 INFO L93 Difference]: Finished difference Result 161 states and 770 transitions. [2019-02-15 11:27:45,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:45,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:27:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:45,894 INFO L225 Difference]: With dead ends: 161 [2019-02-15 11:27:45,894 INFO L226 Difference]: Without dead ends: 159 [2019-02-15 11:27:45,895 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-15 11:27:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-15 11:27:45,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2019-02-15 11:27:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-15 11:27:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 724 transitions. [2019-02-15 11:27:45,944 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 724 transitions. Word has length 5 [2019-02-15 11:27:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:45,944 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 724 transitions. [2019-02-15 11:27:45,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 724 transitions. [2019-02-15 11:27:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:45,945 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:45,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:45,945 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:45,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:45,946 INFO L82 PathProgramCache]: Analyzing trace with hash 28830064, now seen corresponding path program 1 times [2019-02-15 11:27:45,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:45,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:45,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:45,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:45,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:46,346 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-15 11:27:46,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:46,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:46,346 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:46,346 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [32], [33] [2019-02-15 11:27:46,347 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:46,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:46,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:46,699 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:46,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:46,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:46,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:46,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 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-15 11:27:46,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:46,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:46,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:46,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:46,881 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-02-15 11:27:46,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:46,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:46,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:46,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:47,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:47,068 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,106 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,175 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,254 INFO L478 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 24 treesize of output 27 [2019-02-15 11:27:47,257 INFO L478 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 27 treesize of output 33 [2019-02-15 11:27:47,260 INFO L478 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 29 treesize of output 43 [2019-02-15 11:27:47,262 INFO L478 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 31 treesize of output 57 [2019-02-15 11:27:47,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:47,268 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:47,277 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:47,278 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,313 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,341 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,363 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,380 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,395 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,408 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,454 INFO L267 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-15 11:27:47,455 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:47,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,499 INFO L478 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 97 [2019-02-15 11:27:47,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:47,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:47,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:47,631 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:47,631 INFO L478 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 105 [2019-02-15 11:27:47,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:47,676 INFO L267 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-15 11:27:47,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-15 11:27:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:47,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:47,717 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-15 11:27:47,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:47,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:27:47,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:47,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:47,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:47,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:47,738 INFO L87 Difference]: Start difference. First operand 121 states and 724 transitions. Second operand 8 states. [2019-02-15 11:27:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:48,134 INFO L93 Difference]: Finished difference Result 156 states and 773 transitions. [2019-02-15 11:27:48,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:27:48,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:27:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:48,137 INFO L225 Difference]: With dead ends: 156 [2019-02-15 11:27:48,137 INFO L226 Difference]: Without dead ends: 154 [2019-02-15 11:27:48,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-15 11:27:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2019-02-15 11:27:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-15 11:27:48,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 733 transitions. [2019-02-15 11:27:48,188 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 733 transitions. Word has length 5 [2019-02-15 11:27:48,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:48,188 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 733 transitions. [2019-02-15 11:27:48,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:48,188 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 733 transitions. [2019-02-15 11:27:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:48,189 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:48,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:48,190 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:48,190 INFO L82 PathProgramCache]: Analyzing trace with hash 28818532, now seen corresponding path program 1 times [2019-02-15 11:27:48,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:48,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:48,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:48,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:48,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:48,455 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-15 11:27:48,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:48,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:48,456 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:48,456 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [32], [33] [2019-02-15 11:27:48,457 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:48,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:49,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:49,064 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:49,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:49,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:49,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:27:49,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:49,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:49,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:49,286 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:27:49,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:49,462 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-02-15 11:27:49,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:49,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:49,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:49,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:49,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:49,637 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,664 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,715 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,773 INFO L478 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 24 treesize of output 27 [2019-02-15 11:27:49,776 INFO L478 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 27 treesize of output 33 [2019-02-15 11:27:49,778 INFO L478 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 29 treesize of output 43 [2019-02-15 11:27:49,780 INFO L478 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 31 treesize of output 57 [2019-02-15 11:27:49,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:49,788 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:49,794 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:49,795 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,832 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,860 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,881 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,899 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,913 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,927 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:49,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:49,973 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:50,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,006 INFO L478 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 97 [2019-02-15 11:27:50,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:50,050 INFO L267 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-15 11:27:50,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:50,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:50,251 INFO L303 Elim1Store]: Index analysis took 184 ms [2019-02-15 11:27:50,252 INFO L478 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 111 [2019-02-15 11:27:50,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:50,309 INFO L267 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-15 11:27:50,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 11:27:50,328 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-15 11:27:50,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:50,338 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-15 11:27:50,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:50,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:27:50,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:50,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:50,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:27:50,357 INFO L87 Difference]: Start difference. First operand 123 states and 733 transitions. Second operand 8 states. [2019-02-15 11:27:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:50,678 INFO L93 Difference]: Finished difference Result 168 states and 891 transitions. [2019-02-15 11:27:50,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:50,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:27:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:50,681 INFO L225 Difference]: With dead ends: 168 [2019-02-15 11:27:50,681 INFO L226 Difference]: Without dead ends: 167 [2019-02-15 11:27:50,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-15 11:27:50,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2019-02-15 11:27:50,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-15 11:27:50,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 865 transitions. [2019-02-15 11:27:50,745 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 865 transitions. Word has length 5 [2019-02-15 11:27:50,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:50,745 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 865 transitions. [2019-02-15 11:27:50,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 865 transitions. [2019-02-15 11:27:50,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:50,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:50,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:50,746 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:50,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:50,746 INFO L82 PathProgramCache]: Analyzing trace with hash 28818344, now seen corresponding path program 1 times [2019-02-15 11:27:50,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:50,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:50,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:50,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:50,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:50,852 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-15 11:27:50,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:50,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:50,852 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:50,853 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [26], [31] [2019-02-15 11:27:50,854 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:50,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:51,145 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:51,145 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:51,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:51,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:51,146 INFO 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-15 11:27:51,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:51,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:51,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:51,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 27 [2019-02-15 11:27:51,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:51,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:51,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:51,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:51,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,237 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:51,246 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:51,247 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,286 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,316 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:51,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:51,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:51,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:51,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:51,625 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,650 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,674 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,699 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,724 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,771 INFO L267 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-15 11:27:51,771 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:51,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,823 INFO L478 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 97 [2019-02-15 11:27:51,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:51,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:51,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,898 INFO L478 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 111 [2019-02-15 11:27:51,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:51,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:51,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 11:27:51,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:51,986 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:51,987 INFO L478 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 134 [2019-02-15 11:27:51,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:52,038 INFO L267 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-15 11:27:52,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 11:27:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:52,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:52,082 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-15 11:27:52,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:52,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:27:52,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:52,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:52,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:52,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:52,101 INFO L87 Difference]: Start difference. First operand 139 states and 865 transitions. Second operand 10 states. [2019-02-15 11:27:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:52,789 INFO L93 Difference]: Finished difference Result 242 states and 1262 transitions. [2019-02-15 11:27:52,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:27:52,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:27:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:52,792 INFO L225 Difference]: With dead ends: 242 [2019-02-15 11:27:52,792 INFO L226 Difference]: Without dead ends: 240 [2019-02-15 11:27:52,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:27:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-02-15 11:27:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 178. [2019-02-15 11:27:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-15 11:27:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 1177 transitions. [2019-02-15 11:27:52,865 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 1177 transitions. Word has length 5 [2019-02-15 11:27:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:52,865 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 1177 transitions. [2019-02-15 11:27:52,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 1177 transitions. [2019-02-15 11:27:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:52,866 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:52,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:52,867 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:52,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash 28835830, now seen corresponding path program 1 times [2019-02-15 11:27:52,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:52,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:52,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:52,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:52,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:52,990 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-15 11:27:52,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:52,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:52,991 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:52,991 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [32], [33] [2019-02-15 11:27:52,992 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:52,993 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:53,231 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:53,232 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:53,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:53,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:53,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:53,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:27:53,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:53,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:53,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:53,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:27:53,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:53,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:53,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:53,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:53,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,327 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:53,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,340 INFO L478 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 37 treesize of output 120 [2019-02-15 11:27:53,341 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,395 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,427 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,451 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:27:53,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:27:53,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:27:53,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:27:53,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,772 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:27:53,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:53,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-15 11:27:53,868 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,904 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,941 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:53,979 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,018 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,056 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,120 INFO L267 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-15 11:27:54,120 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 11:27:54,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-02-15 11:27:54,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,211 INFO L267 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-15 11:27:54,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 11:27:54,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:54,244 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:54,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 134 [2019-02-15 11:27:54,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:54,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:54,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-02-15 11:27:54,329 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-15 11:27:54,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:54,349 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-15 11:27:54,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:54,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:27:54,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:54,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:54,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:54,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:54,370 INFO L87 Difference]: Start difference. First operand 178 states and 1177 transitions. Second operand 8 states. [2019-02-15 11:27:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:54,919 INFO L93 Difference]: Finished difference Result 211 states and 1231 transitions. [2019-02-15 11:27:54,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:27:54,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:27:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:54,922 INFO L225 Difference]: With dead ends: 211 [2019-02-15 11:27:54,923 INFO L226 Difference]: Without dead ends: 203 [2019-02-15 11:27:54,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-15 11:27:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2019-02-15 11:27:55,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-02-15 11:27:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 1188 transitions. [2019-02-15 11:27:55,016 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 1188 transitions. Word has length 5 [2019-02-15 11:27:55,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:55,016 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 1188 transitions. [2019-02-15 11:27:55,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:55,016 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 1188 transitions. [2019-02-15 11:27:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:55,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:55,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:55,018 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:55,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:55,018 INFO L82 PathProgramCache]: Analyzing trace with hash 28822376, now seen corresponding path program 1 times [2019-02-15 11:27:55,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:55,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:55,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:55,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:55,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:55,080 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-15 11:27:55,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:55,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:55,080 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:55,080 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [32], [33] [2019-02-15 11:27:55,081 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:55,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:55,295 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:55,295 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:55,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:55,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:55,295 INFO 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-15 11:27:55,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:55,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:55,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:55,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:27:55,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:55,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:55,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:55,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:55,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,389 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:55,399 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:55,399 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,438 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,470 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:55,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:55,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:55,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:55,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:55,780 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,805 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,829 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,854 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,878 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:55,924 INFO L267 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-15 11:27:55,925 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:55,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:55,974 INFO L478 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 97 [2019-02-15 11:27:55,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:56,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:56,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:56,045 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:56,046 INFO L478 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 105 [2019-02-15 11:27:56,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:56,090 INFO L267 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-15 11:27:56,090 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-15 11:27:56,110 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-15 11:27:56,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:56,131 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-15 11:27:56,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:56,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:27:56,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:56,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:27:56,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:27:56,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:27:56,151 INFO L87 Difference]: Start difference. First operand 176 states and 1188 transitions. Second operand 8 states. [2019-02-15 11:27:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:56,588 INFO L93 Difference]: Finished difference Result 201 states and 1233 transitions. [2019-02-15 11:27:56,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:27:56,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:27:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:56,592 INFO L225 Difference]: With dead ends: 201 [2019-02-15 11:27:56,592 INFO L226 Difference]: Without dead ends: 200 [2019-02-15 11:27:56,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:27:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-02-15 11:27:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2019-02-15 11:27:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-15 11:27:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 1204 transitions. [2019-02-15 11:27:56,663 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 1204 transitions. Word has length 5 [2019-02-15 11:27:56,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:56,663 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 1204 transitions. [2019-02-15 11:27:56,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:27:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 1204 transitions. [2019-02-15 11:27:56,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:56,664 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:56,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:56,664 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:56,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:56,665 INFO L82 PathProgramCache]: Analyzing trace with hash 29302192, now seen corresponding path program 1 times [2019-02-15 11:27:56,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:56,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:56,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:56,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:56,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:56,824 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-15 11:27:56,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:56,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:56,825 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:56,825 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [31] [2019-02-15 11:27:56,826 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:56,826 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:57,116 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:57,116 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:27:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:57,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:57,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:57,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:27:57,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:57,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:57,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:57,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:27:57,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:27:57,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:27:57,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:27:57,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:27:57,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,212 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:27:57,223 INFO L478 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 37 treesize of output 96 [2019-02-15 11:27:57,224 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,266 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,297 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,322 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,342 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,358 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:57,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:27:57,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:27:57,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:27:57,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:27:57,623 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,648 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,672 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,696 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,721 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:57,768 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:27:57,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,820 INFO L478 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 97 [2019-02-15 11:27:57,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:57,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:27:57,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,895 INFO L478 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 103 [2019-02-15 11:27:57,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:57,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:27:57,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 11:27:57,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,974 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:27:57,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:57,976 INFO L478 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 122 [2019-02-15 11:27:57,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:27:58,022 INFO L267 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-15 11:27:58,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 11:27:58,043 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-15 11:27:58,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:27:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:27:58,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:27:58,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:27:58,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:27:58,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:27:58,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:27:58,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:27:58,099 INFO L87 Difference]: Start difference. First operand 178 states and 1204 transitions. Second operand 10 states. [2019-02-15 11:27:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:27:58,844 INFO L93 Difference]: Finished difference Result 245 states and 1358 transitions. [2019-02-15 11:27:58,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:27:58,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:27:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:27:58,848 INFO L225 Difference]: With dead ends: 245 [2019-02-15 11:27:58,848 INFO L226 Difference]: Without dead ends: 243 [2019-02-15 11:27:58,849 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-15 11:27:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-15 11:27:58,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 191. [2019-02-15 11:27:58,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-15 11:27:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1287 transitions. [2019-02-15 11:27:58,934 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1287 transitions. Word has length 5 [2019-02-15 11:27:58,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:27:58,935 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1287 transitions. [2019-02-15 11:27:58,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:27:58,935 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1287 transitions. [2019-02-15 11:27:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:27:58,935 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:27:58,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:27:58,936 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:27:58,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:58,936 INFO L82 PathProgramCache]: Analyzing trace with hash 29295188, now seen corresponding path program 1 times [2019-02-15 11:27:58,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:27:58,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:58,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:58,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:27:58,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:27:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:59,066 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-15 11:27:59,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:59,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:27:59,066 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:27:59,067 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [32], [33] [2019-02-15 11:27:59,067 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:27:59,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:27:59,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:27:59,562 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:27:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:27:59,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:27:59,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:27:59,563 INFO 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-15 11:27:59,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:27:59,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:27:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:27:59,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:27:59,793 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-02-15 11:27:59,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:59,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:27:59,958 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-02-15 11:27:59,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:59,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:27:59,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:28:00,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:28:00,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:28:00,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:28:00,127 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,153 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:28:00,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:28:00,271 INFO L478 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 29 treesize of output 43 [2019-02-15 11:28:00,274 INFO L478 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 31 treesize of output 57 [2019-02-15 11:28:00,277 INFO L478 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 33 treesize of output 75 [2019-02-15 11:28:00,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:28:00,288 INFO L478 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 37 treesize of output 96 [2019-02-15 11:28:00,289 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,325 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,353 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,375 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,392 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,407 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,420 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:00,466 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 11:28:00,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,498 INFO L478 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 97 [2019-02-15 11:28:00,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,542 INFO L267 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-15 11:28:00,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 11:28:00,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:00,571 INFO L478 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 111 [2019-02-15 11:28:00,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:00,618 INFO L267 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-15 11:28:00,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 11:28:00,635 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-15 11:28:00,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:00,641 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-15 11:28:00,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:00,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-15 11:28:00,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:00,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:28:00,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:28:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:28:00,660 INFO L87 Difference]: Start difference. First operand 191 states and 1287 transitions. Second operand 8 states. [2019-02-15 11:28:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:01,028 INFO L93 Difference]: Finished difference Result 343 states and 2333 transitions. [2019-02-15 11:28:01,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:28:01,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:28:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:01,033 INFO L225 Difference]: With dead ends: 343 [2019-02-15 11:28:01,033 INFO L226 Difference]: Without dead ends: 342 [2019-02-15 11:28:01,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:28:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-15 11:28:01,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 304. [2019-02-15 11:28:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-15 11:28:01,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 2201 transitions. [2019-02-15 11:28:01,159 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 2201 transitions. Word has length 5 [2019-02-15 11:28:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:01,159 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 2201 transitions. [2019-02-15 11:28:01,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:28:01,159 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 2201 transitions. [2019-02-15 11:28:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:28:01,160 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:01,160 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:28:01,161 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:01,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:01,161 INFO L82 PathProgramCache]: Analyzing trace with hash 29295000, now seen corresponding path program 1 times [2019-02-15 11:28:01,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:01,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:01,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:01,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:01,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:01,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:01,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:01,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:01,264 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:28:01,264 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [26], [31] [2019-02-15 11:28:01,267 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:01,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:01,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:01,557 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:28:01,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:01,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:01,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:01,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:28:01,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:01,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:01,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:01,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:01,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:28:01,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:28:01,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:28:01,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:28:01,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:28:01,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,659 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:28:01,669 INFO L478 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 37 treesize of output 96 [2019-02-15 11:28:01,669 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,708 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,740 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,764 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,801 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:01,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:28:01,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:28:01,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:28:01,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:01,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:28:02,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:28:02,052 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,077 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,101 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,126 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,151 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:02,197 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:28:02,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,258 INFO L478 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 97 [2019-02-15 11:28:02,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:02,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:28:02,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,333 INFO L478 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 111 [2019-02-15 11:28:02,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:02,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 11:28:02,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:02,418 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:02,419 INFO L478 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 134 [2019-02-15 11:28:02,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:02,469 INFO L267 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-15 11:28:02,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 11:28:02,490 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-15 11:28:02,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:02,527 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-15 11:28:02,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:02,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:28:02,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:02,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:28:02,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:28:02,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:28:02,547 INFO L87 Difference]: Start difference. First operand 304 states and 2201 transitions. Second operand 10 states. [2019-02-15 11:28:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:04,268 INFO L93 Difference]: Finished difference Result 369 states and 2390 transitions. [2019-02-15 11:28:04,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:28:04,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:28:04,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:04,273 INFO L225 Difference]: With dead ends: 369 [2019-02-15 11:28:04,273 INFO L226 Difference]: Without dead ends: 367 [2019-02-15 11:28:04,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:28:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-02-15 11:28:04,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 320. [2019-02-15 11:28:04,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-02-15 11:28:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 2329 transitions. [2019-02-15 11:28:04,395 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 2329 transitions. Word has length 5 [2019-02-15 11:28:04,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:04,395 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 2329 transitions. [2019-02-15 11:28:04,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:28:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 2329 transitions. [2019-02-15 11:28:04,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:28:04,396 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:04,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:28:04,396 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:04,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:04,397 INFO L82 PathProgramCache]: Analyzing trace with hash 29312486, now seen corresponding path program 1 times [2019-02-15 11:28:04,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:04,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:04,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:04,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:04,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:04,590 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-02-15 11:28:04,603 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-15 11:28:04,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:04,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:04,603 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:28:04,604 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [32], [33] [2019-02-15 11:28:04,604 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:04,604 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:04,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:04,836 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:28:04,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:04,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:04,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:04,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 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-15 11:28:04,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:04,845 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:04,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:04,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:04,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:28:04,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:04,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:04,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:28:04,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:04,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:04,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:04,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:04,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:28:05,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:28:05,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,144 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:28:05,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-15 11:28:05,248 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,292 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,338 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,431 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 27 [2019-02-15 11:28:05,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:28:05,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:28:05,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:28:05,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:28:05,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:28:05,555 INFO L478 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 37 treesize of output 120 [2019-02-15 11:28:05,555 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,605 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,633 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,655 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,673 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,688 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,701 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,766 INFO L267 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-15 11:28:05,766 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-15 11:28:05,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-02-15 11:28:05,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:05,869 INFO L267 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-15 11:28:05,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 11:28:05,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:05,965 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:05,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 134 [2019-02-15 11:28:05,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:06,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:06,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-02-15 11:28:06,060 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-15 11:28:06,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:06,080 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-15 11:28:06,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:06,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:28:06,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:06,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:28:06,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:28:06,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:28:06,100 INFO L87 Difference]: Start difference. First operand 320 states and 2329 transitions. Second operand 8 states. [2019-02-15 11:28:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:06,722 INFO L93 Difference]: Finished difference Result 354 states and 2377 transitions. [2019-02-15 11:28:06,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:28:06,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:28:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:06,727 INFO L225 Difference]: With dead ends: 354 [2019-02-15 11:28:06,727 INFO L226 Difference]: Without dead ends: 350 [2019-02-15 11:28:06,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-15 11:28:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-02-15 11:28:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 323. [2019-02-15 11:28:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-02-15 11:28:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 2346 transitions. [2019-02-15 11:28:06,847 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 2346 transitions. Word has length 5 [2019-02-15 11:28:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:06,847 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 2346 transitions. [2019-02-15 11:28:06,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:28:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 2346 transitions. [2019-02-15 11:28:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:28:06,848 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:06,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:28:06,848 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash 29299032, now seen corresponding path program 1 times [2019-02-15 11:28:06,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:06,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:06,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:06,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:06,933 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-15 11:28:06,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:06,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:06,934 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:28:06,934 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [32], [33] [2019-02-15 11:28:06,935 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:06,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:07,157 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:07,157 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:28:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:07,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:07,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:07,158 INFO 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-15 11:28:07,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:07,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:07,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:07,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:28:07,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:28:07,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:28:07,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:28:07,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:28:07,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:28:07,256 INFO L478 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 37 treesize of output 96 [2019-02-15 11:28:07,256 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,299 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,349 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,373 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,408 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:28:07,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:28:07,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:28:07,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:28:07,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:28:07,667 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,692 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,715 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,740 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,765 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,811 INFO L267 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-15 11:28:07,812 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-15 11:28:07,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,871 INFO L478 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 97 [2019-02-15 11:28:07,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:07,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 11:28:07,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:07,941 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:07,941 INFO L478 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 105 [2019-02-15 11:28:07,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:07,986 INFO L267 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-15 11:28:07,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-15 11:28:08,006 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-15 11:28:08,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:08,027 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-15 11:28:08,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:08,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:28:08,046 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:08,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:28:08,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:28:08,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:28:08,047 INFO L87 Difference]: Start difference. First operand 323 states and 2346 transitions. Second operand 8 states. [2019-02-15 11:28:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:08,646 INFO L93 Difference]: Finished difference Result 347 states and 2375 transitions. [2019-02-15 11:28:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:28:08,646 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:28:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:08,650 INFO L225 Difference]: With dead ends: 347 [2019-02-15 11:28:08,650 INFO L226 Difference]: Without dead ends: 346 [2019-02-15 11:28:08,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:28:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-02-15 11:28:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 324. [2019-02-15 11:28:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-02-15 11:28:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 2354 transitions. [2019-02-15 11:28:08,794 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 2354 transitions. Word has length 5 [2019-02-15 11:28:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:08,795 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 2354 transitions. [2019-02-15 11:28:08,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:28:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 2354 transitions. [2019-02-15 11:28:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:28:08,796 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:08,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:28:08,796 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:08,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:08,797 INFO L82 PathProgramCache]: Analyzing trace with hash 28958902, now seen corresponding path program 1 times [2019-02-15 11:28:08,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:08,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:08,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:08,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:08,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:08,843 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-15 11:28:08,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:08,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:08,843 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:28:08,843 INFO L207 CegarAbsIntRunner]: [0], [10], [32], [34], [35] [2019-02-15 11:28:08,844 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:08,844 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:09,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:09,016 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:28:09,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:09,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:09,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:09,017 INFO 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-15 11:28:09,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:09,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:09,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:09,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:28:09,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:28:09,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:28:09,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:28:09,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:28:09,313 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,387 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:28:09,512 INFO L478 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 27 treesize of output 33 [2019-02-15 11:28:09,514 INFO L478 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 29 treesize of output 43 [2019-02-15 11:28:09,517 INFO L478 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 31 treesize of output 57 [2019-02-15 11:28:09,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:28:09,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:28:09,532 INFO L478 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 37 treesize of output 96 [2019-02-15 11:28:09,532 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,569 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,597 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,619 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,637 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,651 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,663 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:09,710 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-15 11:28:09,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:09,746 INFO L478 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 97 [2019-02-15 11:28:09,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:09,791 INFO L267 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-15 11:28:09,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 11:28:09,813 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-15 11:28:09,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:09,822 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-15 11:28:09,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:09,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 11:28:09,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:09,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 11:28:09,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 11:28:09,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 11:28:09,842 INFO L87 Difference]: Start difference. First operand 324 states and 2354 transitions. Second operand 6 states. [2019-02-15 11:28:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:10,144 INFO L93 Difference]: Finished difference Result 344 states and 2373 transitions. [2019-02-15 11:28:10,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 11:28:10,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-15 11:28:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:10,149 INFO L225 Difference]: With dead ends: 344 [2019-02-15 11:28:10,149 INFO L226 Difference]: Without dead ends: 343 [2019-02-15 11:28:10,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 11:28:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-02-15 11:28:10,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 324. [2019-02-15 11:28:10,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-02-15 11:28:10,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 2354 transitions. [2019-02-15 11:28:10,267 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 2354 transitions. Word has length 5 [2019-02-15 11:28:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:10,267 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 2354 transitions. [2019-02-15 11:28:10,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 11:28:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 2354 transitions. [2019-02-15 11:28:10,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:28:10,268 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:10,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:28:10,268 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:10,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:10,268 INFO L82 PathProgramCache]: Analyzing trace with hash 28945258, now seen corresponding path program 1 times [2019-02-15 11:28:10,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:10,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:10,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:10,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:10,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-15 11:28:10,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:10,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:10,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:28:10,392 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [31] [2019-02-15 11:28:10,393 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:10,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:10,699 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:10,699 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:28:10,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:10,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:10,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:10,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:28:10,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:10,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:10,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:10,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 27 [2019-02-15 11:28:10,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:28:10,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:28:10,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:28:10,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:28:10,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:10,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:28:10,813 INFO L478 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 37 treesize of output 96 [2019-02-15 11:28:10,814 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:10,854 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:10,886 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:10,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:10,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:10,948 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:10,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:10,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:28:11,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:28:11,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:28:11,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:28:11,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:28:11,201 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:11,225 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:11,249 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:11,273 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:11,298 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:11,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:11,345 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:28:11,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 106 [2019-02-15 11:28:11,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:11,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:11,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-15 11:28:11,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,624 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:11,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 117 [2019-02-15 11:28:11,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:11,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:11,854 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:11,855 INFO L478 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 83 treesize of output 130 [2019-02-15 11:28:11,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:11,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-15 11:28:11,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:189 [2019-02-15 11:28:12,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 152 [2019-02-15 11:28:12,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 11:28:12,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:12,624 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:12,625 INFO L478 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 73 treesize of output 103 [2019-02-15 11:28:12,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:12,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-15 11:28:12,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-15 11:28:21,125 WARN L181 SmtUtils]: Spent 8.20 s on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-15 11:28:21,127 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-15 11:28:21,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:21,175 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-15 11:28:21,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:21,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:28:21,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:21,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:28:21,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:28:21,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:28:21,195 INFO L87 Difference]: Start difference. First operand 324 states and 2354 transitions. Second operand 10 states. [2019-02-15 11:28:21,423 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-02-15 11:28:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:25,198 INFO L93 Difference]: Finished difference Result 434 states and 2876 transitions. [2019-02-15 11:28:25,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:28:25,198 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 11:28:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:25,203 INFO L225 Difference]: With dead ends: 434 [2019-02-15 11:28:25,203 INFO L226 Difference]: Without dead ends: 432 [2019-02-15 11:28:25,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:28:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-02-15 11:28:25,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 339. [2019-02-15 11:28:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-02-15 11:28:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 2453 transitions. [2019-02-15 11:28:25,332 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 2453 transitions. Word has length 5 [2019-02-15 11:28:25,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:25,332 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 2453 transitions. [2019-02-15 11:28:25,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:28:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 2453 transitions. [2019-02-15 11:28:25,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:28:25,333 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:25,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:28:25,333 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:25,333 INFO L82 PathProgramCache]: Analyzing trace with hash 28933852, now seen corresponding path program 2 times [2019-02-15 11:28:25,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:25,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:25,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:25,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:25,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:25,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:25,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:25,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:25,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:28:25,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:28:25,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:25,395 INFO 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-15 11:28:25,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:28:25,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:28:25,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-15 11:28:25,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:28:25,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:25,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:28:25,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:28:25,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:28:25,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:28:25,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:28:25,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,476 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:28:25,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,489 INFO L478 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 37 treesize of output 120 [2019-02-15 11:28:25,490 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:25,546 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:25,578 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:25,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:25,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:25,639 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:25,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:25,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-02-15 11:28:25,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-02-15 11:28:25,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-02-15 11:28:25,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-02-15 11:28:25,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:25,924 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-02-15 11:28:26,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-15 11:28:26,025 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,067 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,104 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,142 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,181 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,219 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:26,284 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-02-15 11:28:26,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-02-15 11:28:26,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,371 INFO L267 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-15 11:28:26,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-15 11:28:26,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:26,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-02-15 11:28:26,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:26,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:26,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-15 11:28:26,486 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-15 11:28:26,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:26,498 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-15 11:28:26,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:26,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:28:26,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:26,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:28:26,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:28:26,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:28:26,517 INFO L87 Difference]: Start difference. First operand 339 states and 2453 transitions. Second operand 8 states. [2019-02-15 11:28:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:28:27,646 INFO L93 Difference]: Finished difference Result 472 states and 3201 transitions. [2019-02-15 11:28:27,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:28:27,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 11:28:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:28:27,652 INFO L225 Difference]: With dead ends: 472 [2019-02-15 11:28:27,652 INFO L226 Difference]: Without dead ends: 471 [2019-02-15 11:28:27,652 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-15 11:28:27,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-02-15 11:28:27,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 396. [2019-02-15 11:28:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-02-15 11:28:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 2917 transitions. [2019-02-15 11:28:27,810 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 2917 transitions. Word has length 5 [2019-02-15 11:28:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:28:27,810 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 2917 transitions. [2019-02-15 11:28:27,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:28:27,810 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 2917 transitions. [2019-02-15 11:28:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 11:28:27,811 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:28:27,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 11:28:27,811 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:28:27,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:27,812 INFO L82 PathProgramCache]: Analyzing trace with hash 28952946, now seen corresponding path program 1 times [2019-02-15 11:28:27,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:28:27,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:27,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:28:27,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:28:27,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:28:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:27,981 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2019-02-15 11:28:28,062 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-15 11:28:28,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:28,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:28:28,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 11:28:28,063 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [28], [31] [2019-02-15 11:28:28,065 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-15 11:28:28,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:28:28,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:28:28,417 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:28:28,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:28:28,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:28:28,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:28:28,417 INFO 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-15 11:28:28,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:28:28,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:28:28,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:28:28,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:28:28,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-15 11:28:28,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-15 11:28:28,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-15 11:28:28,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-15 11:28:28,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-15 11:28:28,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,511 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-15 11:28:28,525 INFO L478 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 37 treesize of output 96 [2019-02-15 11:28:28,525 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:28,563 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:28,595 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:28,617 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:28,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:28,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:28,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:28,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:28:28,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:28:28,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:28:28,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:28:28,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:28,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:28:28,907 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:28,947 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:28,972 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:28,997 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:29,022 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:28:29,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-15 11:28:29,068 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-15 11:28:29,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 106 [2019-02-15 11:28:29,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:29,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-15 11:28:29,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-15 11:28:29,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,327 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:29,328 INFO L478 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 83 treesize of output 128 [2019-02-15 11:28:29,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:29,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,444 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:29,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 133 [2019-02-15 11:28:29,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-15 11:28:29,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-15 11:28:29,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:189 [2019-02-15 11:28:29,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:29,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 136 [2019-02-15 11:28:29,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 11:28:30,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:28:30,236 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:28:30,237 INFO L478 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 73 treesize of output 109 [2019-02-15 11:28:30,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:28:30,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-15 11:28:30,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-15 11:28:30,679 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-15 11:28:30,680 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-15 11:28:30,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:28:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:28:30,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:28:30,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:28:30,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:28:30,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:28:30,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:28:30,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:28:30,750 INFO L87 Difference]: Start difference. First operand 396 states and 2917 transitions. Second operand 10 states. [2019-02-15 11:28:31,045 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2019-02-15 11:28:33,047 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-15 11:28:33,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:28:33,048 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 43 more [2019-02-15 11:28:33,052 INFO L168 Benchmark]: Toolchain (without parser) took 150541.82 ms. Allocated memory was 133.7 MB in the beginning and 621.3 MB in the end (delta: 487.6 MB). Free memory was 108.9 MB in the beginning and 177.3 MB in the end (delta: -68.3 MB). Peak memory consumption was 419.2 MB. Max. memory is 7.1 GB. [2019-02-15 11:28:33,053 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 11:28:33,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.75 ms. Allocated memory is still 133.7 MB. Free memory was 108.5 MB in the beginning and 106.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-15 11:28:33,054 INFO L168 Benchmark]: Boogie Preprocessor took 24.60 ms. Allocated memory is still 133.7 MB. Free memory was 106.3 MB in the beginning and 105.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-15 11:28:33,054 INFO L168 Benchmark]: RCFGBuilder took 491.29 ms. Allocated memory is still 133.7 MB. Free memory was 105.1 MB in the beginning and 92.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2019-02-15 11:28:33,054 INFO L168 Benchmark]: TraceAbstraction took 149966.74 ms. Allocated memory was 133.7 MB in the beginning and 621.3 MB in the end (delta: 487.6 MB). Free memory was 92.5 MB in the beginning and 177.3 MB in the end (delta: -84.8 MB). Peak memory consumption was 402.8 MB. Max. memory is 7.1 GB. [2019-02-15 11:28:33,056 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 109.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.75 ms. Allocated memory is still 133.7 MB. Free memory was 108.5 MB in the beginning and 106.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.60 ms. Allocated memory is still 133.7 MB. Free memory was 106.3 MB in the beginning and 105.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 491.29 ms. Allocated memory is still 133.7 MB. Free memory was 105.1 MB in the beginning and 92.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 149966.74 ms. Allocated memory was 133.7 MB in the beginning and 621.3 MB in the end (delta: 487.6 MB). Free memory was 92.5 MB in the beginning and 177.3 MB in the end (delta: -84.8 MB). Peak memory consumption was 402.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...