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-1ae3202 [2019-03-04 16:55:03,282 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:55:03,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:55:03,297 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:55:03,297 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:55:03,298 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:55:03,300 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:55:03,302 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:55:03,303 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:55:03,304 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:55:03,305 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:55:03,305 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:55:03,306 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:55:03,308 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:55:03,309 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:55:03,310 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:55:03,311 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:55:03,313 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:55:03,315 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:55:03,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:55:03,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:55:03,319 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:55:03,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:55:03,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:55:03,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:55:03,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:55:03,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:55:03,325 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:55:03,327 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:55:03,328 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:55:03,328 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:55:03,331 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:55:03,331 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:55:03,331 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:55:03,332 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:55:03,333 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:55:03,333 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-03-04 16:55:03,359 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:55:03,359 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:55:03,360 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:55:03,360 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:55:03,361 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:55:03,361 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:55:03,361 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:55:03,361 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:55:03,361 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:55:03,362 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:55:03,363 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:55:03,363 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:55:03,363 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:55:03,364 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:55:03,364 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:55:03,364 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:55:03,364 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:55:03,364 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:55:03,366 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:55:03,366 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:55:03,366 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:55:03,367 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:55:03,367 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:55:03,367 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:55:03,367 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:55:03,367 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:55:03,367 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:55:03,368 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:55:03,368 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:55:03,368 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:55:03,368 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:55:03,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:55:03,369 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:55:03,369 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:55:03,369 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:55:03,369 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:55:03,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:55:03,370 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:55:03,371 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:55:03,412 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:55:03,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:55:03,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:55:03,432 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:55:03,433 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:55:03,434 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-03-04 16:55:03,434 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2019-03-04 16:55:03,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:55:03,471 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:55:03,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:55:03,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:55:03,472 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:55:03,487 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 04.03 04:55:03" (1/1) ... [2019-03-04 16:55:03,499 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 04.03 04:55:03" (1/1) ... [2019-03-04 16:55:03,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:55:03,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:55:03,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:55:03,527 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:55:03,537 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 04.03 04:55:03" (1/1) ... [2019-03-04 16:55:03,538 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 04.03 04:55:03" (1/1) ... [2019-03-04 16:55:03,540 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 04.03 04:55:03" (1/1) ... [2019-03-04 16:55:03,540 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 04.03 04:55:03" (1/1) ... [2019-03-04 16:55:03,544 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 04.03 04:55:03" (1/1) ... [2019-03-04 16:55:03,548 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 04.03 04:55:03" (1/1) ... [2019-03-04 16:55:03,549 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 04.03 04:55:03" (1/1) ... [2019-03-04 16:55:03,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:55:03,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:55:03,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:55:03,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:55:03,553 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 04.03 04:55:03" (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-03-04 16:55:03,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:55:03,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:55:04,079 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:55:04,080 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-03-04 16:55:04,081 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:55:04 BoogieIcfgContainer [2019-03-04 16:55:04,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:55:04,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:55:04,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:55:04,086 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:55:04,086 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 04.03 04:55:03" (1/2) ... [2019-03-04 16:55:04,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a7872ce and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:55:04, skipping insertion in model container [2019-03-04 16:55:04,088 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 04.03 04:55:04" (2/2) ... [2019-03-04 16:55:04,089 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2019-03-04 16:55:04,099 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:55:04,112 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-03-04 16:55:04,130 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-03-04 16:55:04,163 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:55:04,163 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:55:04,163 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:55:04,164 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:55:04,164 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:55:04,164 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:55:04,164 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:55:04,164 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:55:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-03-04 16:55:04,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-03-04 16:55:04,186 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:04,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-03-04 16:55:04,190 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:04,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-03-04 16:55:04,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:04,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:04,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:04,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:04,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:04,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:04,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:55:04,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:55:04,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:04,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:55:04,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:55:04,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:55:04,453 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-03-04 16:55:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:04,638 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-03-04 16:55:04,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:55:04,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-03-04 16:55:04,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:04,655 INFO L225 Difference]: With dead ends: 33 [2019-03-04 16:55:04,655 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:55:04,659 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-03-04 16:55:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:55:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-03-04 16:55:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-03-04 16:55:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-03-04 16:55:04,702 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-03-04 16:55:04,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:04,703 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-03-04 16:55:04,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:55:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-03-04 16:55:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:55:04,709 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:04,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:55:04,709 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-03-04 16:55:04,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:04,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:04,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:04,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:04,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:04,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:04,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:55:04,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-03-04 16:55:04,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:04,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:55:04,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:55:04,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:55:04,775 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-03-04 16:55:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:05,037 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-03-04 16:55:05,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:55:05,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-03-04 16:55:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:05,039 INFO L225 Difference]: With dead ends: 28 [2019-03-04 16:55:05,039 INFO L226 Difference]: Without dead ends: 27 [2019-03-04 16:55:05,041 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-03-04 16:55:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-03-04 16:55:05,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-03-04 16:55:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:55:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-03-04 16:55:05,046 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-03-04 16:55:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:05,046 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-03-04 16:55:05,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:55:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-03-04 16:55:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:55:05,047 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:05,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:55:05,047 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-03-04 16:55:05,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:05,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:05,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:05,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:05,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:05,288 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-03-04 16:55:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:05,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:05,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:05,350 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:55:05,352 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-03-04 16:55:05,412 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:05,412 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:06,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:06,490 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-03-04 16:55:06,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:06,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:06,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:06,498 INFO 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-03-04 16:55:06,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:06,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:06,549 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:55:06,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:06,982 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:06,983 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:06,992 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:07,019 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:07,157 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:07,235 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:07,349 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:07,483 INFO L453 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-03-04 16:55:07,499 INFO L453 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 29 [2019-03-04 16:55:07,519 INFO L453 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 31 [2019-03-04 16:55:07,541 INFO L453 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 33 [2019-03-04 16:55:07,565 INFO L453 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 35 [2019-03-04 16:55:07,578 INFO L453 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 37 [2019-03-04 16:55:07,800 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:07,802 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:07,823 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:07,838 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:07,885 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:08,058 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:08,188 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:08,206 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:08,266 INFO L309 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-03-04 16:55:08,267 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:08,375 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:08,376 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:08,511 INFO L309 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-03-04 16:55:08,512 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:55:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:08,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:08,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:08,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:55:08,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:08,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:55:08,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:55:08,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:55:08,630 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-03-04 16:55:09,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:09,084 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-03-04 16:55:09,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:55:09,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:55:09,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:09,088 INFO L225 Difference]: With dead ends: 54 [2019-03-04 16:55:09,088 INFO L226 Difference]: Without dead ends: 52 [2019-03-04 16:55:09,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:55:09,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-03-04 16:55:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-03-04 16:55:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-03-04 16:55:09,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-03-04 16:55:09,095 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-03-04 16:55:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:09,095 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-03-04 16:55:09,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:55:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-03-04 16:55:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:55:09,096 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:09,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:55:09,096 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:09,097 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-03-04 16:55:09,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:09,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:09,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:09,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:09,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:09,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:09,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:09,182 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:55:09,183 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-03-04 16:55:09,185 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:09,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:09,546 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:09,546 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-03-04 16:55:09,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:09,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:09,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:09,547 INFO 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-03-04 16:55:09,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:09,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:09,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:09,576 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:55:09,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:09,613 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:55:09,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,645 INFO L453 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 29 [2019-03-04 16:55:09,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,655 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,663 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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 31 [2019-03-04 16:55:09,673 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,675 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,677 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,681 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,683 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,685 INFO L453 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 33 [2019-03-04 16:55:09,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,740 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,742 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,748 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,778 INFO L453 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 35 [2019-03-04 16:55:09,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,789 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,800 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,802 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,804 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,805 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,807 INFO L453 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 37 [2019-03-04 16:55:09,813 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,814 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,816 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,817 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,819 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,822 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,824 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,825 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,826 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,829 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,830 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,832 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,834 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,838 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:09,896 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:09,899 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,920 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,962 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,977 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:09,995 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,012 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,031 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,113 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:10,114 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,124 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,136 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,149 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,174 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,222 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,272 INFO L309 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-03-04 16:55:10,273 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:10,393 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:10,394 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:10,443 INFO L309 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-03-04 16:55:10,444 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:55:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:10,457 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:10,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:55:10,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:55:10,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:10,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:55:10,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:55:10,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:55:10,487 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-03-04 16:55:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:10,554 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-03-04 16:55:10,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:55:10,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-03-04 16:55:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:10,557 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:55:10,557 INFO L226 Difference]: Without dead ends: 24 [2019-03-04 16:55:10,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:55:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-03-04 16:55:10,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-03-04 16:55:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-03-04 16:55:10,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-03-04 16:55:10,563 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-03-04 16:55:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:10,564 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-03-04 16:55:10,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:55:10,564 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-03-04 16:55:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:55:10,564 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:10,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:55:10,565 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:10,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-03-04 16:55:10,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:10,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:10,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:10,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:10,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:10,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:10,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:10,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:55:10,677 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-03-04 16:55:10,680 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:10,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:11,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:11,016 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-03-04 16:55:11,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:11,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:11,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:11,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 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-03-04 16:55:11,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:11,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:11,052 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:55:11,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:11,075 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:55:11,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,087 INFO L453 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 29 [2019-03-04 16:55:11,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,100 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,104 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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 31 [2019-03-04 16:55:11,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,117 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,119 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,121 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,124 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,125 INFO L453 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 33 [2019-03-04 16:55:11,134 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,136 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,138 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,143 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,145 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,147 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,149 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,154 INFO L453 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 35 [2019-03-04 16:55:11,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,175 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,177 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,179 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,200 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,203 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,205 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,207 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,214 INFO L453 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 37 [2019-03-04 16:55:11,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,254 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,279 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,304 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,329 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,333 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,346 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:11,351 INFO L301 Elim1Store]: Index analysis took 117 ms [2019-03-04 16:55:11,416 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:11,418 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,444 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,461 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,481 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,497 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,516 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,535 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,630 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:11,631 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,639 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,647 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,663 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,682 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,725 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,845 INFO L309 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-03-04 16:55:11,846 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:11,886 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:11,887 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:11,955 INFO L309 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-03-04 16:55:11,956 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:55:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:11,976 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:12,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:12,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:55:12,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:12,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:55:12,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:55:12,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:55:12,008 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-03-04 16:55:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:12,352 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-03-04 16:55:12,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:55:12,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:55:12,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:12,355 INFO L225 Difference]: With dead ends: 57 [2019-03-04 16:55:12,355 INFO L226 Difference]: Without dead ends: 56 [2019-03-04 16:55:12,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:55:12,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-03-04 16:55:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-03-04 16:55:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-03-04 16:55:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-03-04 16:55:12,364 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-03-04 16:55:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:12,364 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-03-04 16:55:12,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:55:12,365 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-03-04 16:55:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-03-04 16:55:12,365 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:12,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-03-04 16:55:12,366 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:12,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:12,366 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-03-04 16:55:12,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:12,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:12,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:12,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:12,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:12,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:12,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-03-04 16:55:12,424 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-03-04 16:55:12,427 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:12,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:12,740 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:12,741 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-03-04 16:55:12,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:12,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:12,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:12,742 INFO 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-03-04 16:55:12,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:12,760 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:12,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:55:12,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:12,818 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:55:12,871 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,872 INFO L453 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 29 [2019-03-04 16:55:12,922 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,927 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,929 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,930 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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 31 [2019-03-04 16:55:12,974 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,976 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,978 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,980 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,982 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,983 INFO L453 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 33 [2019-03-04 16:55:12,989 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,990 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,992 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,993 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,994 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,995 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,997 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:12,998 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,000 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,025 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,027 INFO L453 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 35 [2019-03-04 16:55:13,041 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,042 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,043 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,044 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,045 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,047 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,058 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,063 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,065 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,066 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,072 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,073 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,074 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,075 INFO L453 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 37 [2019-03-04 16:55:13,080 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,082 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,084 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,086 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,087 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,088 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,090 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,091 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,092 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,095 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,096 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,098 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:13,144 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:13,145 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,160 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,177 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,191 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,207 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,224 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,239 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,306 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:13,307 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,313 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,323 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,335 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,354 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,384 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,436 INFO L309 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-03-04 16:55:13,436 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:13,589 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:13,590 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:13,634 INFO L309 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-03-04 16:55:13,635 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:55:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:13,669 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:13,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:13,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:13,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:55:13,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:13,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:55:13,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:55:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:55:13,701 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-03-04 16:55:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:14,051 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-03-04 16:55:14,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:55:14,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-03-04 16:55:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:14,054 INFO L225 Difference]: With dead ends: 59 [2019-03-04 16:55:14,054 INFO L226 Difference]: Without dead ends: 57 [2019-03-04 16:55:14,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:55:14,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-03-04 16:55:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-03-04 16:55:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-03-04 16:55:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-03-04 16:55:14,065 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-03-04 16:55:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:14,065 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-03-04 16:55:14,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:55:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-03-04 16:55:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:14,066 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:14,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:14,066 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:14,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:14,067 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-03-04 16:55:14,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:14,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:14,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:14,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:14,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:14,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:14,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:55:14,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:55:14,146 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:14,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:55:14,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:55:14,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:55:14,147 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 4 states. [2019-03-04 16:55:14,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:14,258 INFO L93 Difference]: Finished difference Result 37 states and 114 transitions. [2019-03-04 16:55:14,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-03-04 16:55:14,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:55:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:14,259 INFO L225 Difference]: With dead ends: 37 [2019-03-04 16:55:14,260 INFO L226 Difference]: Without dead ends: 36 [2019-03-04 16:55:14,260 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-03-04 16:55:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-03-04 16:55:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-03-04 16:55:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-03-04 16:55:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2019-03-04 16:55:14,267 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 111 transitions. Word has length 4 [2019-03-04 16:55:14,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:14,267 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 111 transitions. [2019-03-04 16:55:14,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:55:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 111 transitions. [2019-03-04 16:55:14,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:14,268 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:14,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:14,269 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:14,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:14,269 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-03-04 16:55:14,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:14,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:14,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:14,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:14,270 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:14,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:14,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:14,391 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:14,391 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-03-04 16:55:14,392 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:14,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:14,716 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:14,716 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-03-04 16:55:14,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:14,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:14,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:14,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:55:14,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:14,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:14,739 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:55:14,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:14,810 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:14,810 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,841 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,857 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,882 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,921 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:14,972 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,012 INFO L453 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-03-04 16:55:15,015 INFO L453 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 29 [2019-03-04 16:55:15,019 INFO L453 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 31 [2019-03-04 16:55:15,026 INFO L453 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 33 [2019-03-04 16:55:15,030 INFO L453 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 35 [2019-03-04 16:55:15,035 INFO L453 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 37 [2019-03-04 16:55:15,087 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:15,088 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,102 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,116 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,131 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,145 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,160 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,175 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,222 INFO L309 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-03-04 16:55:15,223 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:15,279 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:15,280 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:15,326 INFO L309 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-03-04 16:55:15,327 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:73 [2019-03-04 16:55:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:15,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:15,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-03-04 16:55:15,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-03-04 16:55:15,380 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:15,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:55:15,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:55:15,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:55:15,380 INFO L87 Difference]: Start difference. First operand 32 states and 111 transitions. Second operand 4 states. [2019-03-04 16:55:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:15,465 INFO L93 Difference]: Finished difference Result 36 states and 122 transitions. [2019-03-04 16:55:15,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:55:15,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:55:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:15,467 INFO L225 Difference]: With dead ends: 36 [2019-03-04 16:55:15,467 INFO L226 Difference]: Without dead ends: 35 [2019-03-04 16:55:15,468 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-03-04 16:55:15,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-03-04 16:55:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-03-04 16:55:15,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-03-04 16:55:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 121 transitions. [2019-03-04 16:55:15,475 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 121 transitions. Word has length 4 [2019-03-04 16:55:15,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:15,475 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 121 transitions. [2019-03-04 16:55:15,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:55:15,475 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 121 transitions. [2019-03-04 16:55:15,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:15,476 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:15,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:15,476 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:15,477 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-03-04 16:55:15,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:15,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:15,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:15,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:15,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:15,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:15,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:15,583 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:15,584 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-03-04 16:55:15,587 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:15,587 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:15,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:15,997 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-03-04 16:55:15,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:15,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:15,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:15,997 INFO 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-03-04 16:55:16,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:16,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:16,023 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:16,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:16,035 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:55:16,046 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,047 INFO L453 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 29 [2019-03-04 16:55:16,060 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,062 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,064 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,065 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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 31 [2019-03-04 16:55:16,106 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,107 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,108 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,111 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,113 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,115 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,116 INFO L453 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 33 [2019-03-04 16:55:16,140 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,142 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,144 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,146 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,150 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,152 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,153 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,154 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,156 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,158 INFO L453 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 35 [2019-03-04 16:55:16,168 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,170 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,172 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,174 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,178 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,180 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,182 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,185 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,187 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,190 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,193 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,195 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,202 INFO L453 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 37 [2019-03-04 16:55:16,210 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,213 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,216 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,219 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,222 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,225 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,227 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,229 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,231 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,234 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,237 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,239 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,243 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,245 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:16,323 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:16,324 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,342 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,358 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,376 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,397 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,417 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,443 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,524 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:16,525 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,532 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,541 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,553 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,605 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,634 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,683 INFO L309 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-03-04 16:55:16,684 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:16,768 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:16,769 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,811 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:16,811 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:55:16,858 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:55:16,859 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:16,891 INFO L309 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-03-04 16:55:16,892 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-03-04 16:55:16,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:16,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:16,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:16,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:55:16,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:16,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:16,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:16,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:16,960 INFO L87 Difference]: Start difference. First operand 34 states and 121 transitions. Second operand 8 states. [2019-03-04 16:55:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:17,517 INFO L93 Difference]: Finished difference Result 79 states and 193 transitions. [2019-03-04 16:55:17,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:55:17,518 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:55:17,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:17,520 INFO L225 Difference]: With dead ends: 79 [2019-03-04 16:55:17,520 INFO L226 Difference]: Without dead ends: 77 [2019-03-04 16:55:17,521 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-03-04 16:55:17,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-03-04 16:55:17,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2019-03-04 16:55:17,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:55:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-03-04 16:55:17,531 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-03-04 16:55:17,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:17,531 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-03-04 16:55:17,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-03-04 16:55:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:17,532 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:17,532 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:17,532 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:17,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-03-04 16:55:17,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:17,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:17,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:17,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:17,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:17,910 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:55:17,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:17,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:17,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:17,923 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:17,923 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-03-04 16:55:17,925 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:17,925 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:18,312 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:18,312 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-03-04 16:55:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:18,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:18,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:18,313 INFO 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-03-04 16:55:18,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:18,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:18,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:18,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:18,333 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:55:18,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,341 INFO L453 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 29 [2019-03-04 16:55:18,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,351 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,354 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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 31 [2019-03-04 16:55:18,362 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,364 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,366 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,368 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,370 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,372 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,375 INFO L453 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 33 [2019-03-04 16:55:18,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,390 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,394 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,396 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,397 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,398 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,400 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,401 INFO L453 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 35 [2019-03-04 16:55:18,408 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,410 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,412 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,414 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,416 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,418 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,420 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,422 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,425 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,426 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,427 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,428 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,429 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,431 INFO L453 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 37 [2019-03-04 16:55:18,437 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,439 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,440 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,441 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,443 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,444 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,445 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,447 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,448 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,449 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,450 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,452 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,453 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,454 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,456 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:18,503 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:18,505 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,519 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,539 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,554 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,567 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,584 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,598 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,665 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:18,666 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,670 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,678 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,695 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,716 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,744 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,811 INFO L309 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-03-04 16:55:18,811 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:18,900 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:18,901 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:18,944 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:18,945 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:55:18,986 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:55:18,987 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:19,021 INFO L309 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-03-04 16:55:19,022 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:55:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:19,043 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:19,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:19,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:55:19,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:19,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:19,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:19,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:19,092 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-03-04 16:55:19,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:19,540 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-03-04 16:55:19,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:55:19,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:55:19,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:19,542 INFO L225 Difference]: With dead ends: 74 [2019-03-04 16:55:19,542 INFO L226 Difference]: Without dead ends: 73 [2019-03-04 16:55:19,543 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-03-04 16:55:19,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-03-04 16:55:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-03-04 16:55:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:55:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-03-04 16:55:19,552 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-03-04 16:55:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:19,552 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-03-04 16:55:19,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-03-04 16:55:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:19,553 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:19,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:19,553 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:19,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:19,554 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-03-04 16:55:19,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:19,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:19,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:19,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:19,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:19,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:19,635 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:19,635 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-03-04 16:55:19,636 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:19,637 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:19,957 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:19,957 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-03-04 16:55:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:19,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:19,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:19,958 INFO 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-03-04 16:55:19,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:19,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:19,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:19,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:20,394 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:20,394 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,403 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,417 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,435 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,455 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,485 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,519 INFO L453 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-03-04 16:55:20,524 INFO L453 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 29 [2019-03-04 16:55:20,528 INFO L453 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 31 [2019-03-04 16:55:20,532 INFO L453 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 33 [2019-03-04 16:55:20,537 INFO L453 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 35 [2019-03-04 16:55:20,543 INFO L453 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 37 [2019-03-04 16:55:20,604 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:20,605 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,617 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,629 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,644 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,658 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,673 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,685 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,735 INFO L309 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-03-04 16:55:20,735 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:20,800 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:20,801 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,845 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:20,846 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:55:20,949 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:55:20,950 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:20,986 INFO L309 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-03-04 16:55:20,986 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:55:21,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:21,006 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:21,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:21,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:55:21,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:21,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:21,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:21,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:21,046 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-03-04 16:55:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:21,628 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-03-04 16:55:21,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:55:21,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:55:21,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:21,630 INFO L225 Difference]: With dead ends: 74 [2019-03-04 16:55:21,630 INFO L226 Difference]: Without dead ends: 72 [2019-03-04 16:55:21,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 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-03-04 16:55:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-03-04 16:55:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2019-03-04 16:55:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-03-04 16:55:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 149 transitions. [2019-03-04 16:55:21,639 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 149 transitions. Word has length 4 [2019-03-04 16:55:21,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:21,639 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 149 transitions. [2019-03-04 16:55:21,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:21,639 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 149 transitions. [2019-03-04 16:55:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:21,640 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:21,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:21,640 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:21,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:21,640 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-03-04 16:55:21,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:21,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:21,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:21,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:21,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:21,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:21,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:21,796 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-03-04 16:55:21,798 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:21,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:22,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:22,155 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-03-04 16:55:22,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:22,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:22,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:22,156 INFO 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-03-04 16:55:22,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:22,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:22,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:22,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:22,196 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:55:22,201 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,202 INFO L453 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 29 [2019-03-04 16:55:22,212 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,218 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,219 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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 31 [2019-03-04 16:55:22,273 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,284 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,287 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,290 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,292 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,295 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,296 INFO L453 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 33 [2019-03-04 16:55:22,313 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,314 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,316 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,317 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,319 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,320 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,321 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,322 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,323 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,324 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,325 INFO L453 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 35 [2019-03-04 16:55:22,330 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,341 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,342 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,343 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,344 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,345 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,347 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,348 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,349 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,350 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,352 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,353 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,354 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,356 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,357 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,358 INFO L453 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 37 [2019-03-04 16:55:22,376 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,377 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,378 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,379 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,380 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,383 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,384 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,385 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,387 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,388 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,389 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,391 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,392 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,393 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:22,439 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:22,441 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,455 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,471 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,488 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,510 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,525 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,540 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,633 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:22,633 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,637 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,644 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,659 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,679 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,709 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:22,759 INFO L309 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-03-04 16:55:22,759 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:22,819 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:55:22,821 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:55:22,943 INFO L309 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-03-04 16:55:22,943 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:152 [2019-03-04 16:55:23,157 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 113 [2019-03-04 16:55:23,158 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:23,329 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 121 [2019-03-04 16:55:23,341 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2019-03-04 16:55:23,835 INFO L309 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-03-04 16:55:23,835 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:479 [2019-03-04 16:55:34,634 WARN L181 SmtUtils]: Spent 10.49 s on a formula simplification. DAG size of input: 275 DAG size of output: 128 [2019-03-04 16:55:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:34,636 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:34,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:34,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:55:34,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:34,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:34,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:34,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:55:34,688 INFO L87 Difference]: Start difference. First operand 40 states and 149 transitions. Second operand 8 states. [2019-03-04 16:55:35,233 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2019-03-04 16:55:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:47,252 INFO L93 Difference]: Finished difference Result 79 states and 233 transitions. [2019-03-04 16:55:47,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:55:47,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:55:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:47,254 INFO L225 Difference]: With dead ends: 79 [2019-03-04 16:55:47,254 INFO L226 Difference]: Without dead ends: 71 [2019-03-04 16:55:47,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-03-04 16:55:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-03-04 16:55:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:55:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 177 transitions. [2019-03-04 16:55:47,270 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 177 transitions. Word has length 4 [2019-03-04 16:55:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:47,270 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 177 transitions. [2019-03-04 16:55:47,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 177 transitions. [2019-03-04 16:55:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:47,271 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:47,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:47,271 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:47,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:47,271 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-03-04 16:55:47,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:47,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:47,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:47,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:47,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:55:47,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:55:47,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-03-04 16:55:47,393 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:55:47,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:55:47,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:55:47,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:55:47,394 INFO L87 Difference]: Start difference. First operand 41 states and 177 transitions. Second operand 4 states. [2019-03-04 16:55:47,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:47,467 INFO L93 Difference]: Finished difference Result 53 states and 195 transitions. [2019-03-04 16:55:47,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:55:47,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-03-04 16:55:47,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:47,469 INFO L225 Difference]: With dead ends: 53 [2019-03-04 16:55:47,469 INFO L226 Difference]: Without dead ends: 52 [2019-03-04 16:55:47,470 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-03-04 16:55:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-03-04 16:55:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-03-04 16:55:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-03-04 16:55:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 186 transitions. [2019-03-04 16:55:47,481 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 186 transitions. Word has length 4 [2019-03-04 16:55:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:47,481 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 186 transitions. [2019-03-04 16:55:47,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:55:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 186 transitions. [2019-03-04 16:55:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:47,482 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:47,482 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:47,482 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:47,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:47,483 INFO L82 PathProgramCache]: Analyzing trace with hash 929876, now seen corresponding path program 1 times [2019-03-04 16:55:47,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:47,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:47,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:47,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:47,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:47,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:47,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:47,565 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:47,565 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [31] [2019-03-04 16:55:47,566 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:47,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:47,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:47,869 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-03-04 16:55:47,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:47,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:47,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:47,870 INFO 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-03-04 16:55:47,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:47,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:47,893 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:47,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:47,958 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:47,958 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:47,965 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:47,976 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,015 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,040 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,071 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,110 INFO L453 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-03-04 16:55:48,114 INFO L453 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 29 [2019-03-04 16:55:48,117 INFO L453 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 31 [2019-03-04 16:55:48,121 INFO L453 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 33 [2019-03-04 16:55:48,126 INFO L453 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 35 [2019-03-04 16:55:48,131 INFO L453 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 37 [2019-03-04 16:55:48,214 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:48,216 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,231 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,305 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,318 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,333 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,348 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,363 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,436 INFO L309 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-03-04 16:55:48,437 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:48,490 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:48,491 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,549 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:48,550 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:55:48,585 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:55:48,586 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:48,619 INFO L309 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-03-04 16:55:48,620 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:55:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:48,638 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:48,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:48,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:48,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:55:48,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:48,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:48,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:48,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:55:48,673 INFO L87 Difference]: Start difference. First operand 43 states and 186 transitions. Second operand 8 states. [2019-03-04 16:55:49,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:49,256 INFO L93 Difference]: Finished difference Result 87 states and 278 transitions. [2019-03-04 16:55:49,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:55:49,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:55:49,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:49,258 INFO L225 Difference]: With dead ends: 87 [2019-03-04 16:55:49,258 INFO L226 Difference]: Without dead ends: 85 [2019-03-04 16:55:49,259 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-03-04 16:55:49,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-03-04 16:55:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 41. [2019-03-04 16:55:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-03-04 16:55:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 149 transitions. [2019-03-04 16:55:49,270 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 149 transitions. Word has length 4 [2019-03-04 16:55:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:49,270 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 149 transitions. [2019-03-04 16:55:49,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 149 transitions. [2019-03-04 16:55:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:49,271 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:49,271 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:49,272 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:49,272 INFO L82 PathProgramCache]: Analyzing trace with hash 945688, now seen corresponding path program 1 times [2019-03-04 16:55:49,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:49,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:49,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:49,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:49,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:49,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:49,384 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:49,384 INFO L207 CegarAbsIntRunner]: [0], [22], [32], [33] [2019-03-04 16:55:49,385 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:49,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:49,598 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:49,598 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-03-04 16:55:49,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:49,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:49,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:49,599 INFO 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-03-04 16:55:49,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:49,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:49,616 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-03-04 16:55:49,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:49,626 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:55:49,631 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,632 INFO L453 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 29 [2019-03-04 16:55:49,641 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,643 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,645 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,646 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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 31 [2019-03-04 16:55:49,652 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,656 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,658 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,660 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,662 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,663 INFO L453 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 33 [2019-03-04 16:55:49,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,674 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,676 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,678 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,680 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,682 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,686 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,704 INFO L453 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 35 [2019-03-04 16:55:49,713 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,727 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,739 INFO L453 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 37 [2019-03-04 16:55:49,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,752 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,753 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,754 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,755 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,758 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,761 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,765 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:49,871 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:49,873 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,889 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,905 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,922 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,937 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,952 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:49,968 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,090 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:50,090 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,124 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,139 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,163 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,190 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,220 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,269 INFO L309 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-03-04 16:55:50,269 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:50,306 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:50,307 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:50,353 INFO L309 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-03-04 16:55:50,353 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-03-04 16:55:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:50,371 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:50,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:50,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-03-04 16:55:50,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:50,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-03-04 16:55:50,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-03-04 16:55:50,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:55:50,402 INFO L87 Difference]: Start difference. First operand 41 states and 149 transitions. Second operand 6 states. [2019-03-04 16:55:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:50,595 INFO L93 Difference]: Finished difference Result 64 states and 185 transitions. [2019-03-04 16:55:50,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:55:50,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-03-04 16:55:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:50,597 INFO L225 Difference]: With dead ends: 64 [2019-03-04 16:55:50,597 INFO L226 Difference]: Without dead ends: 63 [2019-03-04 16:55:50,598 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-03-04 16:55:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-03-04 16:55:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2019-03-04 16:55:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-03-04 16:55:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 157 transitions. [2019-03-04 16:55:50,608 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 157 transitions. Word has length 4 [2019-03-04 16:55:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:50,608 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 157 transitions. [2019-03-04 16:55:50,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-03-04 16:55:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 157 transitions. [2019-03-04 16:55:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:50,609 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:50,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:50,609 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:50,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:50,610 INFO L82 PathProgramCache]: Analyzing trace with hash 945004, now seen corresponding path program 1 times [2019-03-04 16:55:50,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:50,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:50,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:50,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:50,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:50,748 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:50,748 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [31] [2019-03-04 16:55:50,749 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:50,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:51,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:51,054 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-03-04 16:55:51,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:51,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:51,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:51,055 INFO 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-03-04 16:55:51,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:51,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:51,069 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:51,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:51,074 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:55:51,083 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,084 INFO L453 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 29 [2019-03-04 16:55:51,094 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,097 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,099 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,100 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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 31 [2019-03-04 16:55:51,151 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,176 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,194 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,215 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,257 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,257 INFO L301 Elim1Store]: Index analysis took 130 ms [2019-03-04 16:55:51,258 INFO L453 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 33 [2019-03-04 16:55:51,308 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,335 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,360 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,382 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,407 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,430 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,455 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,474 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,500 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,516 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,516 INFO L301 Elim1Store]: Index analysis took 233 ms [2019-03-04 16:55:51,518 INFO L453 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 35 [2019-03-04 16:55:51,569 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,605 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,629 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,654 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,672 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,693 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,719 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,751 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,774 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,821 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,846 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,874 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,875 INFO L301 Elim1Store]: Index analysis took 331 ms [2019-03-04 16:55:51,876 INFO L453 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 37 [2019-03-04 16:55:51,924 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,949 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,967 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:51,979 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,002 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,027 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,052 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,078 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,103 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,123 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,148 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,173 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,198 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,223 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,241 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:52,242 INFO L301 Elim1Store]: Index analysis took 339 ms [2019-03-04 16:55:52,930 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:52,931 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,118 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,313 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,513 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,573 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,590 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,607 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,731 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:53,732 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,756 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,925 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,973 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:53,995 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:54,025 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:54,074 INFO L309 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-03-04 16:55:54,075 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:54,143 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:54,144 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:54,189 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:54,189 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:55:54,229 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:55:54,230 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:54,266 INFO L309 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-03-04 16:55:54,266 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:55:54,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-03-04 16:55:54,291 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:54,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:54,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:55:54,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:54,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:54,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:55:54,330 INFO L87 Difference]: Start difference. First operand 42 states and 157 transitions. Second operand 8 states. [2019-03-04 16:55:55,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:55,301 INFO L93 Difference]: Finished difference Result 98 states and 268 transitions. [2019-03-04 16:55:55,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:55:55,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:55:55,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:55,303 INFO L225 Difference]: With dead ends: 98 [2019-03-04 16:55:55,303 INFO L226 Difference]: Without dead ends: 97 [2019-03-04 16:55:55,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-03-04 16:55:55,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-03-04 16:55:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 47. [2019-03-04 16:55:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-03-04 16:55:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 197 transitions. [2019-03-04 16:55:55,318 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 197 transitions. Word has length 4 [2019-03-04 16:55:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:55,318 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 197 transitions. [2019-03-04 16:55:55,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 197 transitions. [2019-03-04 16:55:55,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:55,319 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:55,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:55,320 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:55,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:55,320 INFO L82 PathProgramCache]: Analyzing trace with hash 945500, now seen corresponding path program 1 times [2019-03-04 16:55:55,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:55,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:55,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:55,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:55,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:55,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:55,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:55,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:55,406 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [31] [2019-03-04 16:55:55,407 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:55,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:55,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:55,649 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-03-04 16:55:55,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:55,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:55,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:55,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:55:55,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:55,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:55,664 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:55,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:55,672 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:55:55,684 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,684 INFO L453 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 29 [2019-03-04 16:55:55,692 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,694 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,697 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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 31 [2019-03-04 16:55:55,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,708 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,714 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,716 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,717 INFO L453 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 33 [2019-03-04 16:55:55,731 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,739 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,741 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,745 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,746 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,747 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,749 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,750 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,751 INFO L453 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 35 [2019-03-04 16:55:55,757 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,759 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,760 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,762 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,763 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,764 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,766 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,767 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,768 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,769 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,771 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,772 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,773 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,775 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,776 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,777 INFO L453 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 37 [2019-03-04 16:55:55,782 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,783 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,785 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,786 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,787 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,788 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,790 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,791 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,793 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,794 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,795 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,797 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,798 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,799 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,801 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:55,843 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:55,844 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,861 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,877 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,894 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,910 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,926 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:55,941 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:56,018 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:56,019 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:56,028 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:56,040 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:56,053 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:56,077 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:56,106 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:56,157 INFO L309 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-03-04 16:55:56,158 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:56,214 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:56,214 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:56,258 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:56,259 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-03-04 16:55:56,295 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 43 [2019-03-04 16:55:56,296 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:56,329 INFO L309 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-03-04 16:55:56,329 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:57 [2019-03-04 16:55:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:56,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:56,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:56,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:55:56,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:56,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:56,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:56,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:56,399 INFO L87 Difference]: Start difference. First operand 47 states and 197 transitions. Second operand 8 states. [2019-03-04 16:55:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:56,853 INFO L93 Difference]: Finished difference Result 91 states and 282 transitions. [2019-03-04 16:55:56,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:55:56,854 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:55:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:56,855 INFO L225 Difference]: With dead ends: 91 [2019-03-04 16:55:56,855 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:55:56,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:55:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:55:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2019-03-04 16:55:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-03-04 16:55:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 243 transitions. [2019-03-04 16:55:56,870 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 243 transitions. Word has length 4 [2019-03-04 16:55:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:56,870 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 243 transitions. [2019-03-04 16:55:56,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 243 transitions. [2019-03-04 16:55:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:56,871 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:56,871 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:56,871 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash 933968, now seen corresponding path program 1 times [2019-03-04 16:55:56,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:56,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:56,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:57,028 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-03-04 16:55:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:57,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:57,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:57,042 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:57,042 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [31] [2019-03-04 16:55:57,043 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:57,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:57,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:57,300 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-03-04 16:55:57,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:57,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:57,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:57,301 INFO 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-03-04 16:55:57,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:57,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:57,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:57,315 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:57,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:57,572 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:57,572 INFO L309 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:57,595 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:57,701 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:57,870 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,037 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,067 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,105 INFO L453 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-03-04 16:55:58,113 INFO L453 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 29 [2019-03-04 16:55:58,116 INFO L453 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 31 [2019-03-04 16:55:58,120 INFO L453 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 33 [2019-03-04 16:55:58,125 INFO L453 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 35 [2019-03-04 16:55:58,129 INFO L453 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 37 [2019-03-04 16:55:58,179 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:58,180 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,193 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,208 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,222 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,236 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,251 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,266 INFO L309 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,316 INFO L309 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-03-04 16:55:58,317 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:55:58,368 INFO L453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-03-04 16:55:58,368 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,414 INFO L309 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-03-04 16:55:58,414 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:73 [2019-03-04 16:55:58,457 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 45 [2019-03-04 16:55:58,458 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:58,491 INFO L309 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-03-04 16:55:58,492 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:63 [2019-03-04 16:55:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:58,509 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:58,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:58,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:58,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-03-04 16:55:58,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:58,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:55:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:55:58,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:55:58,551 INFO L87 Difference]: Start difference. First operand 56 states and 243 transitions. Second operand 8 states. [2019-03-04 16:55:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:59,022 INFO L93 Difference]: Finished difference Result 92 states and 291 transitions. [2019-03-04 16:55:59,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:55:59,022 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-03-04 16:55:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:59,024 INFO L225 Difference]: With dead ends: 92 [2019-03-04 16:55:59,024 INFO L226 Difference]: Without dead ends: 90 [2019-03-04 16:55:59,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-03-04 16:55:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-03-04 16:55:59,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2019-03-04 16:55:59,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:55:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 254 transitions. [2019-03-04 16:55:59,039 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 254 transitions. Word has length 4 [2019-03-04 16:55:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:59,039 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 254 transitions. [2019-03-04 16:55:59,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:55:59,039 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 254 transitions. [2019-03-04 16:55:59,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-03-04 16:55:59,040 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:59,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-03-04 16:55:59,041 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:59,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:59,041 INFO L82 PathProgramCache]: Analyzing trace with hash 949406, now seen corresponding path program 1 times [2019-03-04 16:55:59,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:59,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:59,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:59,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:59,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:59,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-03-04 16:55:59,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:59,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:59,173 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-03-04 16:55:59,174 INFO L207 CegarAbsIntRunner]: [0], [26], [28], [31] [2019-03-04 16:55:59,175 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:55:59,175 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:55:59,511 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:55:59,511 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-03-04 16:55:59,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:59,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:55:59,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:59,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:55:59,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:59,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:59,552 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-03-04 16:55:59,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:59,564 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-03-04 16:55:59,572 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,572 INFO L453 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 29 [2019-03-04 16:55:59,579 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,581 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,583 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,584 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select 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 31 [2019-03-04 16:55:59,595 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,598 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,600 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,602 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,604 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,606 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,607 INFO L453 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 33 [2019-03-04 16:55:59,616 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,618 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,620 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,621 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,622 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,623 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,624 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,626 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,627 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,628 INFO L453 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 35 [2019-03-04 16:55:59,679 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,696 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,698 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,700 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,702 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,703 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,704 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,705 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,706 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,707 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,709 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,710 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,711 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,712 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,714 INFO L453 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 37 [2019-03-04 16:55:59,720 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,721 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,722 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,724 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,725 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,726 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,728 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,729 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,730 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,732 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,733 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,734 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,736 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,737 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,738 INFO L188 IndexEqualityManager]: detected not equals via solver [2019-03-04 16:55:59,784 INFO L453 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 6 new quantified variables, introduced 12 case distinctions, treesize of input 37 treesize of output 54 [2019-03-04 16:55:59,785 INFO L309 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-03-04 16:55:59,801 INFO L309 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:59,818 INFO L309 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:59,833 INFO L309 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:59,850 INFO L309 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:59,865 INFO L309 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:59,879 INFO L309 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:55:59,979 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 16 [2019-03-04 16:55:59,979 INFO L309 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,004 INFO L309 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,038 INFO L309 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,057 INFO L309 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,081 INFO L309 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,109 INFO L309 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-03-04 16:56:00,159 INFO L309 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-03-04 16:56:00,159 INFO L209 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-03-04 16:56:00,271 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 48 [2019-03-04 16:56:00,272 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-03-04 16:56:00,342 INFO L309 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-03-04 16:56:00,342 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:152 [2019-03-04 16:56:00,461 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 23 case distinctions, treesize of input 88 treesize of output 125 [2019-03-04 16:56:00,471 INFO L309 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-03-04 16:56:01,022 INFO L453 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 83 treesize of output 113 [2019-03-04 16:56:01,023 INFO L309 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-03-04 16:56:01,296 INFO L309 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-03-04 16:56:01,297 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-03-04 16:56:20,868 WARN L181 SmtUtils]: Spent 17.60 s on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-03-04 16:56:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:20,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:20,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:20,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-03-04 16:56:20,916 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:20,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:56:20,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:56:20,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:56:20,917 INFO L87 Difference]: Start difference. First operand 59 states and 254 transitions. Second operand 8 states. [2019-03-04 16:56:24,820 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-03-04 16:56:24,821 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) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:652) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) 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: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2019-03-04 16:56:24,825 INFO L168 Benchmark]: Toolchain (without parser) took 81355.15 ms. Allocated memory was 131.1 MB in the beginning and 645.4 MB in the end (delta: 514.3 MB). Free memory was 106.4 MB in the beginning and 272.7 MB in the end (delta: -166.4 MB). Peak memory consumption was 348.0 MB. Max. memory is 7.1 GB. [2019-03-04 16:56:24,826 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 131.1 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-03-04 16:56:24,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.72 ms. Allocated memory is still 131.1 MB. Free memory was 106.2 MB in the beginning and 103.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:56:24,827 INFO L168 Benchmark]: Boogie Preprocessor took 24.67 ms. Allocated memory is still 131.1 MB. Free memory was 103.9 MB in the beginning and 102.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:56:24,827 INFO L168 Benchmark]: RCFGBuilder took 530.11 ms. Allocated memory is still 131.1 MB. Free memory was 102.6 MB in the beginning and 90.2 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-03-04 16:56:24,827 INFO L168 Benchmark]: TraceAbstraction took 80741.87 ms. Allocated memory was 131.1 MB in the beginning and 645.4 MB in the end (delta: 514.3 MB). Free memory was 90.0 MB in the beginning and 272.7 MB in the end (delta: -182.7 MB). Peak memory consumption was 331.6 MB. Max. memory is 7.1 GB. [2019-03-04 16:56:24,828 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.22 ms. Allocated memory is still 131.1 MB. Free memory is still 107.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.72 ms. Allocated memory is still 131.1 MB. Free memory was 106.2 MB in the beginning and 103.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.67 ms. Allocated memory is still 131.1 MB. Free memory was 103.9 MB in the beginning and 102.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 530.11 ms. Allocated memory is still 131.1 MB. Free memory was 102.6 MB in the beginning and 90.2 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 80741.87 ms. Allocated memory was 131.1 MB in the beginning and 645.4 MB in the end (delta: 514.3 MB). Free memory was 90.0 MB in the beginning and 272.7 MB in the end (delta: -182.7 MB). Peak memory consumption was 331.6 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) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...