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-0302a3f [2019-02-25 15:52:26,430 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:52:26,432 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:52:26,444 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:52:26,444 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:52:26,445 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:52:26,447 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:52:26,448 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:52:26,450 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:52:26,451 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:52:26,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:52:26,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:52:26,453 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:52:26,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:52:26,455 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:52:26,456 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:52:26,457 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:52:26,459 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:52:26,461 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:52:26,463 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:52:26,464 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:52:26,465 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:52:26,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:52:26,468 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:52:26,468 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:52:26,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:52:26,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:52:26,471 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:52:26,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:52:26,473 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:52:26,473 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:52:26,474 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:52:26,474 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:52:26,474 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:52:26,475 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:52:26,476 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:52:26,476 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-25 15:52:26,499 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:52:26,499 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:52:26,501 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:52:26,501 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:52:26,501 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:52:26,501 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:52:26,504 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:52:26,504 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:52:26,504 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:52:26,504 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:52:26,505 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:52:26,505 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:52:26,505 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:52:26,506 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:52:26,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:52:26,507 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:52:26,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:52:26,508 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:52:26,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:52:26,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:52:26,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:52:26,509 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:52:26,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:52:26,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:52:26,510 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:52:26,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:52:26,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:52:26,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:52:26,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:52:26,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:52:26,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:52:26,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:52:26,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:52:26,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:52:26,513 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:52:26,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:52:26,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:52:26,514 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:52:26,514 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:52:26,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:52:26,583 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:52:26,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:52:26,592 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:52:26,592 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:52:26,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2019-02-25 15:52:26,594 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2019-02-25 15:52:26,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:52:26,636 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:52:26,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:52:26,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:52:26,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:52:26,653 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 25.02 03:52:26" (1/1) ... [2019-02-25 15:52:26,665 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 25.02 03:52:26" (1/1) ... [2019-02-25 15:52:26,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:52:26,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:52:26,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:52:26,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:52:26,704 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 25.02 03:52:26" (1/1) ... [2019-02-25 15:52:26,705 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 25.02 03:52:26" (1/1) ... [2019-02-25 15:52:26,707 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 25.02 03:52:26" (1/1) ... [2019-02-25 15:52:26,707 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 25.02 03:52:26" (1/1) ... [2019-02-25 15:52:26,711 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 25.02 03:52:26" (1/1) ... [2019-02-25 15:52:26,715 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 25.02 03:52:26" (1/1) ... [2019-02-25 15:52:26,717 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 25.02 03:52:26" (1/1) ... [2019-02-25 15:52:26,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:52:26,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:52:26,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:52:26,720 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:52:26,721 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 25.02 03:52:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:52:26,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:52:26,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:52:27,260 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:52:27,261 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-25 15:52:27,262 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:52:27 BoogieIcfgContainer [2019-02-25 15:52:27,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:52:27,264 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:52:27,264 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:52:27,279 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:52:27,280 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 25.02 03:52:26" (1/2) ... [2019-02-25 15:52:27,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d19caab and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:52:27, skipping insertion in model container [2019-02-25 15:52:27,281 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 25.02 03:52:27" (2/2) ... [2019-02-25 15:52:27,283 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2019-02-25 15:52:27,307 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:52:27,320 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-25 15:52:27,339 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-25 15:52:27,377 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:52:27,378 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:52:27,378 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:52:27,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:52:27,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:52:27,379 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:52:27,379 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:52:27,379 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:52:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-25 15:52:27,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:52:27,403 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:27,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:52:27,407 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:27,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:27,413 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-25 15:52:27,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:27,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:27,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:27,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:27,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:27,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:52:27,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:52:27,617 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:27,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:52:27,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:52:27,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:52:27,633 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-25 15:52:27,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:27,857 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-25 15:52:27,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:52:27,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:52:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:27,874 INFO L225 Difference]: With dead ends: 33 [2019-02-25 15:52:27,874 INFO L226 Difference]: Without dead ends: 28 [2019-02-25 15:52:27,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:52:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-25 15:52:27,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-25 15:52:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-25 15:52:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-25 15:52:27,912 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-25 15:52:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:27,913 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-25 15:52:27,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:52:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-25 15:52:27,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:52:27,914 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:27,914 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:52:27,915 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:27,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:27,915 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-25 15:52:27,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:27,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:27,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:27,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:27,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:28,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:28,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:52:28,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:52:28,015 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:28,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:52:28,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:52:28,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:52:28,018 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-25 15:52:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:28,297 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-25 15:52:28,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:52:28,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:52:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:28,299 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:52:28,299 INFO L226 Difference]: Without dead ends: 27 [2019-02-25 15:52:28,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:52:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-25 15:52:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-25 15:52:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:52:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-25 15:52:28,305 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-25 15:52:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:28,305 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-25 15:52:28,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:52:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-25 15:52:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:52:28,306 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:28,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:52:28,307 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:28,307 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-25 15:52:28,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:28,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:28,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:28,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:28,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:28,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:28,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:28,484 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:52:28,486 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-25 15:52:28,539 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:28,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:29,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:29,765 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:29,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:29,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:29,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:29,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:29,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:29,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:29,814 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:29,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:29,999 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:52:30,000 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,128 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,145 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,246 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,318 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,397 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,519 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:52:30,540 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:52:30,564 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:52:30,586 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:52:30,607 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:52:30,630 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:52:30,790 INFO L292 Elim1Store]: Index analysis took 156 ms [2019-02-25 15:52:30,792 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:52:30,796 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,201 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,289 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,322 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,341 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,358 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,374 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,443 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:31,444 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:52:31,527 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,529 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:52:31,531 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,660 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:31,660 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:31,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:31,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:31,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:52:31,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:31,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:52:31,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:52:31,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:52:31,829 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-02-25 15:52:32,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:32,246 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-02-25 15:52:32,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:52:32,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:52:32,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:32,248 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:52:32,249 INFO L226 Difference]: Without dead ends: 52 [2019-02-25 15:52:32,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:52:32,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-25 15:52:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-02-25 15:52:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:52:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-02-25 15:52:32,255 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-02-25 15:52:32,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:32,256 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-02-25 15:52:32,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:52:32,256 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-02-25 15:52:32,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:52:32,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:32,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:52:32,257 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:32,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:32,257 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-02-25 15:52:32,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:32,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:32,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:32,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:32,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:32,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:32,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:32,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:32,362 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:52:32,362 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-02-25 15:52:32,363 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:32,363 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:32,713 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:32,713 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:32,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:32,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:32,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:32,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:32,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:32,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:32,761 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:32,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:32,788 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:52:32,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,836 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:52:32,873 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,899 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:52:32,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,991 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:52:33,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,096 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:52:33,140 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,181 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:52:33,214 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:52:33,216 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,266 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,299 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,328 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,353 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,396 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,414 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,516 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:52:33,517 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,537 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,549 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,563 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,582 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,612 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,664 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:33,665 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:95, output treesize:96 [2019-02-25 15:52:33,900 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-25 15:52:33,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,947 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:52:33,948 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,049 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:34,050 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:34,071 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:34,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:52:34,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:52:34,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:34,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:52:34,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:52:34,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:52:34,103 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-02-25 15:52:34,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:34,166 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-02-25 15:52:34,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:52:34,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:52:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:34,168 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:52:34,168 INFO L226 Difference]: Without dead ends: 24 [2019-02-25 15:52:34,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:52:34,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-25 15:52:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-25 15:52:34,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:52:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-25 15:52:34,175 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-02-25 15:52:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:34,175 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-25 15:52:34,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-25 15:52:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:52:34,176 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:34,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:52:34,177 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-02-25 15:52:34,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:34,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:34,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:34,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:34,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:34,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:34,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:34,247 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:52:34,248 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-02-25 15:52:34,250 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:34,251 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:34,605 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:34,606 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:34,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:34,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:34,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:34,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:34,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:34,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:34,644 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:34,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:34,668 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:52:34,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,709 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:52:34,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,769 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:52:34,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,855 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:52:34,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,911 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:52:34,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,929 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:52:35,003 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:52:35,004 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,086 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,164 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,191 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,210 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,231 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,248 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,329 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:52:35,330 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,346 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,355 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,370 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,390 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,450 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,502 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:35,503 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:52:35,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:35,586 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:52:35,587 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:35,972 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:35,972 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:36,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:36,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:36,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:36,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:52:36,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:36,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:52:36,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:52:36,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:52:36,093 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-02-25 15:52:36,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:36,395 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-02-25 15:52:36,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:52:36,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:52:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:36,398 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:52:36,398 INFO L226 Difference]: Without dead ends: 56 [2019-02-25 15:52:36,399 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-02-25 15:52:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-25 15:52:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-02-25 15:52:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:52:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-02-25 15:52:36,405 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-02-25 15:52:36,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:36,406 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-02-25 15:52:36,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:52:36,406 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-02-25 15:52:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:52:36,406 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:36,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:52:36,407 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:36,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:36,407 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-02-25 15:52:36,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:36,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:36,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:36,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:36,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:36,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:36,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:36,472 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:52:36,472 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-02-25 15:52:36,474 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:36,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:36,779 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:36,780 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:36,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:36,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:36,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:36,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:36,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:36,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:36,817 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:36,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:36,838 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:52:36,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,845 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:52:36,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,852 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:52:36,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,862 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:52:36,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,910 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:52:36,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,919 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:52:36,957 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:52:36,958 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,002 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,032 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,060 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,081 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,097 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,111 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,263 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:52:37,264 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,287 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,298 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,309 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,328 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,357 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,405 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:37,409 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:52:37,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,472 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:52:37,473 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,518 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:37,518 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:37,545 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:37,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:37,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:37,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:52:37,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:37,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:52:37,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:52:37,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:52:37,579 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-02-25 15:52:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:37,966 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-02-25 15:52:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:52:37,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:52:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:37,968 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:52:37,969 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:52:37,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:52:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-25 15:52:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:52:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-02-25 15:52:37,977 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-02-25 15:52:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:37,978 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-02-25 15:52:37,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:52:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-02-25 15:52:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:37,979 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:37,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:37,979 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:37,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:37,979 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-02-25 15:52:37,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:37,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:37,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:37,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:37,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:38,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:52:38,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:52:38,073 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:38,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:52:38,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:52:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:52:38,074 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 4 states. [2019-02-25 15:52:38,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:38,198 INFO L93 Difference]: Finished difference Result 37 states and 114 transitions. [2019-02-25 15:52:38,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:52:38,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:52:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:38,199 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:52:38,199 INFO L226 Difference]: Without dead ends: 36 [2019-02-25 15:52:38,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:52:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-25 15:52:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-02-25 15:52:38,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:52:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2019-02-25 15:52:38,207 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 111 transitions. Word has length 4 [2019-02-25 15:52:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:38,207 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 111 transitions. [2019-02-25 15:52:38,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 111 transitions. [2019-02-25 15:52:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:38,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:38,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:38,209 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:38,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:38,209 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-02-25 15:52:38,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:38,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:38,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:38,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:38,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:38,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:38,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:38,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:38,360 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:38,360 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-02-25 15:52:38,361 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:38,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:38,661 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:38,661 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:38,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:38,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:38,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:38,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:38,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:38,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:38,694 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:38,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:38,909 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:52:38,910 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,007 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,018 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,040 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,067 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,096 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,136 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:52:39,140 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:52:39,143 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:52:39,146 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:52:39,150 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:52:39,155 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:52:39,191 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:52:39,192 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,231 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,260 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,284 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,303 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,319 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,334 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,385 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:39,385 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:52:39,520 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,522 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:52:39,523 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,564 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:39,565 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:39,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:39,584 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:39,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:39,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:52:39,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:52:39,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:39,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:52:39,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:52:39,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:52:39,620 INFO L87 Difference]: Start difference. First operand 32 states and 111 transitions. Second operand 4 states. [2019-02-25 15:52:39,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:39,718 INFO L93 Difference]: Finished difference Result 36 states and 122 transitions. [2019-02-25 15:52:39,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:52:39,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:52:39,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:39,719 INFO L225 Difference]: With dead ends: 36 [2019-02-25 15:52:39,719 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:52:39,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:52:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:52:39,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-25 15:52:39,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-25 15:52:39,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 121 transitions. [2019-02-25 15:52:39,727 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 121 transitions. Word has length 4 [2019-02-25 15:52:39,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:39,727 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 121 transitions. [2019-02-25 15:52:39,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:39,728 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 121 transitions. [2019-02-25 15:52:39,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:39,728 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:39,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:39,729 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:39,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:39,729 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-02-25 15:52:39,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:39,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:39,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:39,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:39,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:39,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:39,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:39,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:39,819 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:39,819 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-02-25 15:52:39,820 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:39,820 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:40,236 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:40,237 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:40,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:40,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:40,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:40,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:40,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:40,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:40,279 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:40,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:40,298 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:52:40,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,333 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:52:40,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,399 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:52:40,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,409 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:52:40,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,423 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:52:40,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,460 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:52:40,477 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:52:40,478 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,549 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,586 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,626 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,645 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,661 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,675 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,736 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:52:40,737 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,753 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,763 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,774 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,793 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,840 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,888 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:40,888 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:52:40,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:40,952 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:52:40,953 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,998 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:40,999 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:41,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,050 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:52:41,050 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,092 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:41,093 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:52:41,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:41,125 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:41,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:41,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:41,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:41,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:41,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:41,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:41,172 INFO L87 Difference]: Start difference. First operand 34 states and 121 transitions. Second operand 8 states. [2019-02-25 15:52:41,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:41,748 INFO L93 Difference]: Finished difference Result 79 states and 193 transitions. [2019-02-25 15:52:41,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:41,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:41,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:41,750 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:52:41,751 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:52:41,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:52:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2019-02-25 15:52:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:52:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-25 15:52:41,761 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-25 15:52:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:41,761 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-25 15:52:41,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-25 15:52:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:41,762 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:41,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:41,763 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-02-25 15:52:41,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:41,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:41,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:41,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:41,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:41,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:41,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:41,870 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:41,870 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-02-25 15:52:41,871 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:41,871 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:42,264 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:42,264 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:42,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:42,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:42,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:42,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:42,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:42,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:42,303 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:42,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:42,322 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:52:42,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,352 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:52:42,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,359 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:52:42,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,371 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:52:42,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,383 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:52:42,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,404 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:52:42,414 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:52:42,415 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,624 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,657 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,682 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,701 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,718 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,735 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,799 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:52:42,799 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,815 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,823 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,840 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,864 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,893 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,942 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:42,943 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:52:43,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,017 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:52:43,018 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,072 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:43,072 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:43,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,105 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:43,106 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:52:43,107 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,152 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:43,152 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:52:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:43,173 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:43,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:43,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:43,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:43,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:43,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:43,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:43,219 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-25 15:52:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:43,788 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-25 15:52:43,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:43,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:43,790 INFO L225 Difference]: With dead ends: 74 [2019-02-25 15:52:43,790 INFO L226 Difference]: Without dead ends: 73 [2019-02-25 15:52:43,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-25 15:52:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-02-25 15:52:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:52:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-25 15:52:43,800 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-25 15:52:43,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:43,800 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-25 15:52:43,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-25 15:52:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:43,801 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:43,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:43,802 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:43,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:43,802 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-02-25 15:52:43,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:43,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:43,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:43,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:43,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:43,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:43,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:43,941 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:43,941 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-02-25 15:52:43,942 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:43,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:44,321 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:44,322 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:44,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:44,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:44,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:44,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:44,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:44,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:44,337 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:44,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:44,398 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:52:44,399 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,427 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,440 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,458 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,480 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,511 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,546 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:52:44,550 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:52:44,553 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:52:44,556 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:52:44,560 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:52:44,564 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:52:44,572 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:52:44,573 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,612 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,643 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,667 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,686 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,702 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,722 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,783 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:44,783 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:52:44,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,849 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:52:44,850 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,901 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:44,902 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:44,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,947 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:44,948 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:52:44,948 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,009 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:45,009 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:52:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:45,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:45,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:45,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:45,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:45,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:45,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:45,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:45,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:45,082 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-25 15:52:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:45,633 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-25 15:52:45,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:45,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:45,634 INFO L225 Difference]: With dead ends: 74 [2019-02-25 15:52:45,634 INFO L226 Difference]: Without dead ends: 72 [2019-02-25 15:52:45,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-25 15:52:45,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2019-02-25 15:52:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-25 15:52:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 149 transitions. [2019-02-25 15:52:45,660 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 149 transitions. Word has length 4 [2019-02-25 15:52:45,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:45,660 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 149 transitions. [2019-02-25 15:52:45,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:45,660 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 149 transitions. [2019-02-25 15:52:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:45,661 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:45,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:45,661 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:45,662 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-02-25 15:52:45,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:45,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:45,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:45,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:45,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:45,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:45,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:45,782 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:45,782 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-02-25 15:52:45,783 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:45,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:46,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:46,154 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:46,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:46,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:46,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:46,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:52:46,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:46,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:46,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:52:46,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:46,222 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:52:46,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,263 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:52:46,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,313 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,314 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:52:46,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,324 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:52:46,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,359 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:52:46,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,375 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:52:46,386 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:52:46,387 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,453 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,662 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,689 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,735 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,752 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,768 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,842 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:52:46,843 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,862 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,868 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,882 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,903 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,933 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,981 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:46,982 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:52:47,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,036 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:52:47,038 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:47,217 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-25 15:52:47,217 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:150 [2019-02-25 15:52:47,263 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,267 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,268 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:47,269 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 91 [2019-02-25 15:52:47,270 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,439 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 130 [2019-02-25 15:52:47,451 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2019-02-25 15:52:48,082 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-02-25 15:52:48,083 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-02-25 15:52:50,599 WARN L181 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-02-25 15:52:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:50,600 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:50,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:50,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:50,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:50,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:50,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:50,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:50,688 INFO L87 Difference]: Start difference. First operand 40 states and 149 transitions. Second operand 8 states. [2019-02-25 15:53:01,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:01,518 INFO L93 Difference]: Finished difference Result 79 states and 233 transitions. [2019-02-25 15:53:01,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:01,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:53:01,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:01,520 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:53:01,520 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:53:01,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:53:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-02-25 15:53:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:53:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 177 transitions. [2019-02-25 15:53:01,530 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 177 transitions. Word has length 4 [2019-02-25 15:53:01,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:01,531 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 177 transitions. [2019-02-25 15:53:01,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 177 transitions. [2019-02-25 15:53:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:01,531 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:01,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:01,532 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:01,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-02-25 15:53:01,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:01,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:01,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:01,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:01,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:53:01,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:53:01,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:53:01,596 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:53:01,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:53:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:53:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:53:01,596 INFO L87 Difference]: Start difference. First operand 41 states and 177 transitions. Second operand 4 states. [2019-02-25 15:53:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:01,669 INFO L93 Difference]: Finished difference Result 53 states and 195 transitions. [2019-02-25 15:53:01,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:53:01,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:53:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:01,670 INFO L225 Difference]: With dead ends: 53 [2019-02-25 15:53:01,670 INFO L226 Difference]: Without dead ends: 52 [2019-02-25 15:53:01,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:53:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-25 15:53:01,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-02-25 15:53:01,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:53:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 186 transitions. [2019-02-25 15:53:01,681 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 186 transitions. Word has length 4 [2019-02-25 15:53:01,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:01,681 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 186 transitions. [2019-02-25 15:53:01,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:53:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 186 transitions. [2019-02-25 15:53:01,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:01,682 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:01,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:01,682 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:01,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:01,683 INFO L82 PathProgramCache]: Analyzing trace with hash 929876, now seen corresponding path program 1 times [2019-02-25 15:53:01,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:01,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:01,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:01,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:01,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:01,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:01,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:01,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:01,770 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:53:01,770 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [31] [2019-02-25 15:53:01,771 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:01,771 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:02,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:02,110 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:02,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:02,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:02,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:02,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:02,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:02,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:02,153 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:53:02,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:02,215 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:02,216 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,250 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,262 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,284 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,308 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,339 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,376 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:02,379 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:02,382 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:02,387 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:02,390 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:02,392 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:02,400 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:02,401 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,440 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,470 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,534 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,554 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,570 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,584 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,634 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:02,634 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:02,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,671 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:02,671 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,714 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:02,715 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:02,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:02,742 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:02,743 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:02,785 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:02,785 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:53:02,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:02,801 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:02,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:02,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:53:02,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:02,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:02,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:02,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:53:02,833 INFO L87 Difference]: Start difference. First operand 43 states and 186 transitions. Second operand 8 states. [2019-02-25 15:53:03,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:03,405 INFO L93 Difference]: Finished difference Result 87 states and 278 transitions. [2019-02-25 15:53:03,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:53:03,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:53:03,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:03,407 INFO L225 Difference]: With dead ends: 87 [2019-02-25 15:53:03,407 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:53:03,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:53:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 41. [2019-02-25 15:53:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:53:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 149 transitions. [2019-02-25 15:53:03,418 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 149 transitions. Word has length 4 [2019-02-25 15:53:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:03,418 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 149 transitions. [2019-02-25 15:53:03,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 149 transitions. [2019-02-25 15:53:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:03,419 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:03,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:03,419 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:03,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash 945688, now seen corresponding path program 1 times [2019-02-25 15:53:03,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:03,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:03,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:03,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:03,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:03,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:03,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:03,500 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:53:03,500 INFO L207 CegarAbsIntRunner]: [0], [22], [32], [33] [2019-02-25 15:53:03,501 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:03,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:03,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:03,835 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:53:03,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:03,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:03,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:03,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:03,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:03,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:03,874 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:53:03,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:03,901 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:03,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:03,940 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:03,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:03,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:03,986 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:03,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:03,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:03,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:03,997 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:04,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,006 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:04,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,015 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:04,038 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:04,040 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,079 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,113 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,138 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,160 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,177 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,191 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,251 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:04,252 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,270 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,284 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,307 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,334 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,363 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,414 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:04,414 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:04,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,486 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:04,487 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,545 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:04,546 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:04,566 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:04,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:04,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:53:04,614 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:04,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:53:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:53:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:53:04,615 INFO L87 Difference]: Start difference. First operand 41 states and 149 transitions. Second operand 6 states. [2019-02-25 15:53:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:04,805 INFO L93 Difference]: Finished difference Result 64 states and 185 transitions. [2019-02-25 15:53:04,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:53:04,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:53:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:04,806 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:53:04,807 INFO L226 Difference]: Without dead ends: 63 [2019-02-25 15:53:04,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:53:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-25 15:53:04,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2019-02-25 15:53:04,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-25 15:53:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 157 transitions. [2019-02-25 15:53:04,817 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 157 transitions. Word has length 4 [2019-02-25 15:53:04,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:04,817 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 157 transitions. [2019-02-25 15:53:04,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:53:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 157 transitions. [2019-02-25 15:53:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:04,818 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:04,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:04,818 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:04,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:04,819 INFO L82 PathProgramCache]: Analyzing trace with hash 945004, now seen corresponding path program 1 times [2019-02-25 15:53:04,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:04,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:04,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:04,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:04,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:05,090 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-02-25 15:53:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:05,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:05,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:05,112 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:53:05,113 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [31] [2019-02-25 15:53:05,114 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:05,114 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:05,437 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:05,437 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:05,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:05,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:05,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:05,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:05,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:05,459 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:53:05,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:05,466 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:05,472 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,473 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:05,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,493 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,494 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:05,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,501 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:05,510 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,551 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,552 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:05,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,563 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,571 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:05,587 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:05,588 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,642 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,678 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,703 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,723 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,743 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,759 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,830 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:05,831 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,842 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,854 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,869 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,890 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,918 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,969 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:05,970 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:06,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,029 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:06,029 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,074 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:06,074 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:06,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,112 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:06,112 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,161 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:06,161 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:53:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:06,184 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:06,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:06,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:53:06,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:06,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:53:06,220 INFO L87 Difference]: Start difference. First operand 42 states and 157 transitions. Second operand 8 states. [2019-02-25 15:53:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:07,228 INFO L93 Difference]: Finished difference Result 98 states and 268 transitions. [2019-02-25 15:53:07,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:53:07,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:53:07,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:07,230 INFO L225 Difference]: With dead ends: 98 [2019-02-25 15:53:07,230 INFO L226 Difference]: Without dead ends: 97 [2019-02-25 15:53:07,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:53:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-25 15:53:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 47. [2019-02-25 15:53:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:53:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 197 transitions. [2019-02-25 15:53:07,244 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 197 transitions. Word has length 4 [2019-02-25 15:53:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:07,244 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 197 transitions. [2019-02-25 15:53:07,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 197 transitions. [2019-02-25 15:53:07,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:07,245 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:07,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:07,246 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:07,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:07,246 INFO L82 PathProgramCache]: Analyzing trace with hash 945500, now seen corresponding path program 1 times [2019-02-25 15:53:07,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:07,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:07,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:07,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:07,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:07,635 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-02-25 15:53:07,807 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-02-25 15:53:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:07,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:07,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:07,900 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:53:07,900 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [31] [2019-02-25 15:53:07,901 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:07,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:08,175 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:08,175 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:08,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:08,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:08,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:08,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:08,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:08,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:08,192 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:53:08,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:08,197 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:08,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,233 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:08,251 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,255 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:08,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,260 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,265 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:08,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,277 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:08,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,287 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:08,307 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:08,308 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,365 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,398 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,425 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,444 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,460 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,477 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,536 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:08,537 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,552 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,564 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,575 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,597 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,627 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,675 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:08,675 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:08,718 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,719 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:08,720 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,764 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:08,765 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:08,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,790 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:08,796 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:08,797 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:08,840 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:08,840 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:53:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:08,858 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:08,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:08,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:08,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:08,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:08,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:08,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:08,909 INFO L87 Difference]: Start difference. First operand 47 states and 197 transitions. Second operand 8 states. [2019-02-25 15:53:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:09,323 INFO L93 Difference]: Finished difference Result 91 states and 282 transitions. [2019-02-25 15:53:09,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:53:09,323 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:53:09,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:09,325 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:53:09,325 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:53:09,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:53:09,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:53:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2019-02-25 15:53:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-25 15:53:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 243 transitions. [2019-02-25 15:53:09,339 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 243 transitions. Word has length 4 [2019-02-25 15:53:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:09,339 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 243 transitions. [2019-02-25 15:53:09,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 243 transitions. [2019-02-25 15:53:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:09,340 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:09,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:09,340 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:09,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:09,341 INFO L82 PathProgramCache]: Analyzing trace with hash 933968, now seen corresponding path program 1 times [2019-02-25 15:53:09,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:09,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:09,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:09,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:09,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:09,500 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:53:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:09,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:09,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:09,513 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:53:09,513 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [31] [2019-02-25 15:53:09,514 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:09,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:09,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:09,799 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:09,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:09,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:09,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:09,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:09,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:09,817 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:53:09,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:10,124 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:10,124 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:10,421 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:10,544 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:10,721 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:10,951 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,052 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,091 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:11,095 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:11,099 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:11,102 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:11,105 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:11,115 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:11,125 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:11,126 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,164 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,194 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,217 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,236 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,252 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,266 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,316 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:11,316 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:11,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,363 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:11,363 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,407 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:11,407 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:11,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,439 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:11,440 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:53:11,440 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,483 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:11,483 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:53:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:11,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:11,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:11,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:11,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:11,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:11,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:11,546 INFO L87 Difference]: Start difference. First operand 56 states and 243 transitions. Second operand 8 states. [2019-02-25 15:53:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:11,953 INFO L93 Difference]: Finished difference Result 92 states and 291 transitions. [2019-02-25 15:53:11,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:53:11,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:53:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:11,954 INFO L225 Difference]: With dead ends: 92 [2019-02-25 15:53:11,955 INFO L226 Difference]: Without dead ends: 90 [2019-02-25 15:53:11,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:53:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-25 15:53:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2019-02-25 15:53:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:53:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 254 transitions. [2019-02-25 15:53:11,967 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 254 transitions. Word has length 4 [2019-02-25 15:53:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:11,968 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 254 transitions. [2019-02-25 15:53:11,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:11,968 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 254 transitions. [2019-02-25 15:53:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:11,969 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:11,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:11,969 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash 949406, now seen corresponding path program 1 times [2019-02-25 15:53:11,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:11,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:11,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:11,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:11,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:12,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:12,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:12,093 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:53:12,093 INFO L207 CegarAbsIntRunner]: [0], [26], [28], [31] [2019-02-25 15:53:12,094 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:12,095 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:12,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:12,370 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:12,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:12,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:12,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:12,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:12,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:12,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:12,389 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:53:12,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:12,394 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:12,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,402 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:12,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,409 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:12,415 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,421 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:12,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,432 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:12,466 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,473 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,476 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:12,498 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:12,499 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,540 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,571 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,620 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,639 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,656 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,670 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,731 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:12,732 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,747 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,758 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,777 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,800 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,829 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,879 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:12,880 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:12,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,973 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:53:12,975 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:53:13,134 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-25 15:53:13,134 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:150 [2019-02-25 15:53:13,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,250 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 130 [2019-02-25 15:53:13,259 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-25 15:53:13,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,961 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:13,962 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 91 [2019-02-25 15:53:13,962 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,231 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-02-25 15:53:14,231 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-02-25 15:53:15,325 WARN L181 SmtUtils]: Spent 914.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-02-25 15:53:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:15,326 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:15,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:15,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:53:15,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:15,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:15,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:15,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:53:15,376 INFO L87 Difference]: Start difference. First operand 59 states and 254 transitions. Second operand 8 states. [2019-02-25 15:53:27,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:27,732 INFO L93 Difference]: Finished difference Result 101 states and 344 transitions. [2019-02-25 15:53:27,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:27,732 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:53:27,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:27,734 INFO L225 Difference]: With dead ends: 101 [2019-02-25 15:53:27,734 INFO L226 Difference]: Without dead ends: 100 [2019-02-25 15:53:27,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-25 15:53:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 63. [2019-02-25 15:53:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:53:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 286 transitions. [2019-02-25 15:53:27,751 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 286 transitions. Word has length 4 [2019-02-25 15:53:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:27,751 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 286 transitions. [2019-02-25 15:53:27,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 286 transitions. [2019-02-25 15:53:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:27,752 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:27,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:27,753 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:27,753 INFO L82 PathProgramCache]: Analyzing trace with hash 951454, now seen corresponding path program 1 times [2019-02-25 15:53:27,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:27,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:27,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:27,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:27,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:27,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:27,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:27,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:27,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:27,840 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:53:27,841 INFO L207 CegarAbsIntRunner]: [0], [28], [32], [33] [2019-02-25 15:53:27,842 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:27,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:29,481 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:29,481 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:53:29,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:29,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:29,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:29,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:29,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:29,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:29,510 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:53:29,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:29,582 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:53:29,583 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:29,613 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:29,636 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:29,666 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:29,705 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:29,749 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:29,803 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:29,862 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:29,865 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:29,868 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:29,871 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:29,874 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:29,878 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:29,880 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:53:29,881 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:29,934 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:29,991 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:30,221 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:30,239 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:30,255 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:30,270 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:30,339 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:30,340 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-02-25 15:53:30,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,366 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:53:30,367 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:30,442 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:30,442 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:53:30,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:30,493 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:30,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:30,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:53:30,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:30,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:53:30,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:53:30,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:53:30,523 INFO L87 Difference]: Start difference. First operand 63 states and 286 transitions. Second operand 6 states. [2019-02-25 15:53:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:30,759 INFO L93 Difference]: Finished difference Result 86 states and 322 transitions. [2019-02-25 15:53:30,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:53:30,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:53:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:30,761 INFO L225 Difference]: With dead ends: 86 [2019-02-25 15:53:30,761 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:53:30,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:53:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:53:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2019-02-25 15:53:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-25 15:53:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 294 transitions. [2019-02-25 15:53:30,773 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 294 transitions. Word has length 4 [2019-02-25 15:53:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:30,774 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 294 transitions. [2019-02-25 15:53:30,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:53:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 294 transitions. [2019-02-25 15:53:30,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:30,774 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:30,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:30,775 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:30,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash 951266, now seen corresponding path program 2 times [2019-02-25 15:53:30,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:30,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:30,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:30,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:30,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:30,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:30,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:30,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:30,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:30,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:30,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:53:30,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:53:30,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:53:30,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:30,910 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:53:30,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:30,918 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:30,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,924 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:30,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,931 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:30,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,940 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:30,946 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,953 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:30,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,968 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:30,986 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:30,997 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:53:30,997 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,072 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,116 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,159 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,204 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,222 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,238 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,313 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:53:31,314 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,340 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,370 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,398 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,435 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,475 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,520 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,590 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:31,591 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:53:31,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,631 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:53:31,631 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,695 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:31,695 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:53:31,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:53:31,736 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,799 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:31,799 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:76 [2019-02-25 15:53:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:31,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:31,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:31,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:53:31,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:31,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:31,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:31,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:53:31,863 INFO L87 Difference]: Start difference. First operand 64 states and 294 transitions. Second operand 8 states. [2019-02-25 15:53:32,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:32,462 INFO L93 Difference]: Finished difference Result 119 states and 384 transitions. [2019-02-25 15:53:32,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:53:32,463 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:53:32,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:32,465 INFO L225 Difference]: With dead ends: 119 [2019-02-25 15:53:32,465 INFO L226 Difference]: Without dead ends: 115 [2019-02-25 15:53:32,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-25 15:53:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 67. [2019-02-25 15:53:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-25 15:53:32,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 286 transitions. [2019-02-25 15:53:32,486 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 286 transitions. Word has length 4 [2019-02-25 15:53:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:32,486 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 286 transitions. [2019-02-25 15:53:32,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 286 transitions. [2019-02-25 15:53:32,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:53:32,487 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:32,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:53:32,487 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:32,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:32,488 INFO L82 PathProgramCache]: Analyzing trace with hash 938000, now seen corresponding path program 1 times [2019-02-25 15:53:32,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:32,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:32,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:32,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:32,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:32,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:32,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:32,643 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:53:32,643 INFO L207 CegarAbsIntRunner]: [0], [14], [32], [33] [2019-02-25 15:53:32,644 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:32,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:32,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:32,848 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:53:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:32,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:32,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:32,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:32,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:32,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:32,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:53:32,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:32,872 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:32,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,877 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:32,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,889 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:32,895 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,900 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,900 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:32,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,915 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:32,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,932 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:32,949 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:32,950 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:32,991 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,025 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,122 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,143 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,161 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,176 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,235 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:33,235 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,251 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,261 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,278 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,296 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,325 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,374 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:33,374 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:33,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:33,408 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:33,409 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:33,452 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:33,453 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:33,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:33,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:33,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:53:33,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:33,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:53:33,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:53:33,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:53:33,504 INFO L87 Difference]: Start difference. First operand 67 states and 286 transitions. Second operand 6 states. [2019-02-25 15:53:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:33,965 INFO L93 Difference]: Finished difference Result 90 states and 322 transitions. [2019-02-25 15:53:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:53:33,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:53:33,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:33,969 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:53:33,969 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:53:33,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:53:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:53:33,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-02-25 15:53:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-25 15:53:33,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 294 transitions. [2019-02-25 15:53:33,988 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 294 transitions. Word has length 4 [2019-02-25 15:53:33,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:33,988 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 294 transitions. [2019-02-25 15:53:33,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:53:33,988 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 294 transitions. [2019-02-25 15:53:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:33,989 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:33,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:33,989 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:33,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:33,989 INFO L82 PathProgramCache]: Analyzing trace with hash 29197230, now seen corresponding path program 1 times [2019-02-25 15:53:33,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:33,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:33,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:33,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:33,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:34,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:34,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:34,134 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:34,134 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [34], [35] [2019-02-25 15:53:34,136 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:34,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:34,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:34,296 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:53:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:34,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:34,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:34,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:34,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:34,309 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:34,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:53:34,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:34,354 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:53:34,354 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,376 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,387 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,401 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,426 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,461 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:34,464 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:34,468 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-25 15:53:34,472 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-25 15:53:34,476 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-25 15:53:34,482 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-25 15:53:34,493 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-25 15:53:34,494 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,527 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,554 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,574 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,590 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,606 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,621 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,693 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:34,693 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:84, output treesize:88 [2019-02-25 15:53:34,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:34,740 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-25 15:53:34,741 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,785 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:34,785 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:63 [2019-02-25 15:53:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:34,810 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:34,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:34,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 6 [2019-02-25 15:53:34,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:34,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:53:34,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:53:34,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:53:34,841 INFO L87 Difference]: Start difference. First operand 68 states and 294 transitions. Second operand 7 states. [2019-02-25 15:53:35,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:35,199 INFO L93 Difference]: Finished difference Result 77 states and 308 transitions. [2019-02-25 15:53:35,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:53:35,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-25 15:53:35,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:35,201 INFO L225 Difference]: With dead ends: 77 [2019-02-25 15:53:35,201 INFO L226 Difference]: Without dead ends: 76 [2019-02-25 15:53:35,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:53:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-25 15:53:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-02-25 15:53:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-25 15:53:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 301 transitions. [2019-02-25 15:53:35,219 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 301 transitions. Word has length 5 [2019-02-25 15:53:35,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:35,219 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 301 transitions. [2019-02-25 15:53:35,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:53:35,219 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 301 transitions. [2019-02-25 15:53:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:35,220 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:35,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:35,220 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:35,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:35,220 INFO L82 PathProgramCache]: Analyzing trace with hash 29172180, now seen corresponding path program 1 times [2019-02-25 15:53:35,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:35,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:35,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:35,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:35,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:53:35,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:35,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:35,297 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:35,297 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [32], [33] [2019-02-25 15:53:35,300 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:35,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:35,591 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:35,592 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:35,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:35,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:35,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:35,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:35,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:35,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:53:35,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:35,648 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:35,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:35,688 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:35,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:35,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:35,754 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:35,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:35,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:35,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:35,835 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:35,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:35,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:35,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:35,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:35,930 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:35,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:35,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,061 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,062 INFO L292 Elim1Store]: Index analysis took 129 ms [2019-02-25 15:53:36,063 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:36,201 INFO L292 Elim1Store]: Index analysis took 137 ms [2019-02-25 15:53:36,202 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:36,203 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,344 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,376 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,402 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,421 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,437 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,453 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,511 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:36,512 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,524 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,536 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,553 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,571 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,600 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,650 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:36,651 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:36,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:36,735 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,800 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:36,801 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:36,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,832 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:53:36,833 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,875 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:36,876 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:53:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:36,899 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:36,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:36,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:36,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:36,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:36,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:36,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:36,945 INFO L87 Difference]: Start difference. First operand 69 states and 301 transitions. Second operand 8 states. [2019-02-25 15:53:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:37,396 INFO L93 Difference]: Finished difference Result 102 states and 353 transitions. [2019-02-25 15:53:37,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:53:37,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:53:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:37,398 INFO L225 Difference]: With dead ends: 102 [2019-02-25 15:53:37,398 INFO L226 Difference]: Without dead ends: 101 [2019-02-25 15:53:37,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:53:37,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-25 15:53:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2019-02-25 15:53:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-25 15:53:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 317 transitions. [2019-02-25 15:53:37,423 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 317 transitions. Word has length 5 [2019-02-25 15:53:37,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:37,423 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 317 transitions. [2019-02-25 15:53:37,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 317 transitions. [2019-02-25 15:53:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:37,424 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:37,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:37,424 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:37,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash 29171496, now seen corresponding path program 1 times [2019-02-25 15:53:37,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:37,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:37,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:37,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:37,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:37,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:37,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:37,594 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:37,594 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [31] [2019-02-25 15:53:37,595 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:37,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:37,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:37,890 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:53:37,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:37,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:37,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:37,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:37,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:37,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:37,906 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:53:37,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:37,964 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:37,964 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:37,981 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:37,989 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,000 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,019 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,050 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,087 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:38,090 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:38,094 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:38,096 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:38,099 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:38,102 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:38,112 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:38,113 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,149 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,180 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,203 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,222 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,238 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,252 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,302 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:38,302 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:38,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,347 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:38,347 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,391 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:38,392 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:38,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,415 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,422 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:53:38,423 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,465 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:38,465 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:53:38,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,491 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,493 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,496 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,498 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,500 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:38,501 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:53:38,502 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,562 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:38,562 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:53:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:38,580 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:38,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:38,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:53:38,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:38,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:38,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:38,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:53:38,625 INFO L87 Difference]: Start difference. First operand 71 states and 317 transitions. Second operand 10 states. [2019-02-25 15:53:40,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:40,089 INFO L93 Difference]: Finished difference Result 147 states and 540 transitions. [2019-02-25 15:53:40,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:53:40,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:53:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:40,092 INFO L225 Difference]: With dead ends: 147 [2019-02-25 15:53:40,092 INFO L226 Difference]: Without dead ends: 146 [2019-02-25 15:53:40,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:53:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-25 15:53:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2019-02-25 15:53:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-25 15:53:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 464 transitions. [2019-02-25 15:53:40,120 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 464 transitions. Word has length 5 [2019-02-25 15:53:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:40,121 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 464 transitions. [2019-02-25 15:53:40,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 464 transitions. [2019-02-25 15:53:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:40,121 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:40,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:40,122 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash 29187556, now seen corresponding path program 1 times [2019-02-25 15:53:40,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:40,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:40,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:40,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:40,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:40,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:40,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:40,266 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:40,266 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [32], [33] [2019-02-25 15:53:40,267 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:40,267 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:40,632 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:40,632 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:40,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:40,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:40,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:40,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:40,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:40,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:40,649 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:53:40,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:40,654 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:40,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,660 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:40,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,670 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:40,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,681 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:40,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,696 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:40,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,712 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:40,730 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:40,731 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,776 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,809 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,836 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,857 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,874 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,890 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,949 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:40,950 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,966 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,976 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,995 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,021 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,065 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,123 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:41,123 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:41,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,184 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:41,185 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,243 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:41,244 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:41,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:41,292 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:53:41,293 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,334 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:41,334 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:53:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:41,355 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:41,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-02-25 15:53:41,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:41,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:41,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:41,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:41,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:41,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:41,398 INFO L87 Difference]: Start difference. First operand 89 states and 464 transitions. Second operand 8 states. [2019-02-25 15:53:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:41,808 INFO L93 Difference]: Finished difference Result 128 states and 531 transitions. [2019-02-25 15:53:41,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:53:41,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:53:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:41,811 INFO L225 Difference]: With dead ends: 128 [2019-02-25 15:53:41,811 INFO L226 Difference]: Without dead ends: 127 [2019-02-25 15:53:41,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:53:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-25 15:53:41,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2019-02-25 15:53:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-25 15:53:41,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 488 transitions. [2019-02-25 15:53:41,847 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 488 transitions. Word has length 5 [2019-02-25 15:53:41,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:41,847 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 488 transitions. [2019-02-25 15:53:41,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:41,847 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 488 transitions. [2019-02-25 15:53:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:41,848 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:41,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:41,848 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:41,849 INFO L82 PathProgramCache]: Analyzing trace with hash 29187368, now seen corresponding path program 1 times [2019-02-25 15:53:41,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:41,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:41,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:41,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:41,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:41,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:41,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:41,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:41,983 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:41,983 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [31] [2019-02-25 15:53:41,983 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:41,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:42,306 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:42,306 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:53:42,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:42,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:42,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:42,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:42,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:42,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:42,327 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:53:42,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:42,333 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-25 15:53:42,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,341 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:42,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,352 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:42,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,365 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:42,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,377 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:42,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,392 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:42,408 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:42,409 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,450 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,480 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,506 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,525 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,541 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,557 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,615 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:42,616 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,632 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,645 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,660 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,683 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,712 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,762 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:42,762 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:42,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,859 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:42,859 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,923 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:42,924 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:42,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:42,962 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:53:42,963 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:43,003 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:43,003 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:53:43,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,032 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,040 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:43,041 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:53:43,042 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:43,083 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:43,084 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:53:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:43,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:43,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:43,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:53:43,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:43,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:43,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:43,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:53:43,186 INFO L87 Difference]: Start difference. First operand 92 states and 488 transitions. Second operand 10 states. [2019-02-25 15:53:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:44,120 INFO L93 Difference]: Finished difference Result 146 states and 591 transitions. [2019-02-25 15:53:44,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:44,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:53:44,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:44,122 INFO L225 Difference]: With dead ends: 146 [2019-02-25 15:53:44,123 INFO L226 Difference]: Without dead ends: 144 [2019-02-25 15:53:44,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:53:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-02-25 15:53:44,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2019-02-25 15:53:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-25 15:53:44,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 536 transitions. [2019-02-25 15:53:44,164 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 536 transitions. Word has length 5 [2019-02-25 15:53:44,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:44,164 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 536 transitions. [2019-02-25 15:53:44,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 536 transitions. [2019-02-25 15:53:44,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:44,165 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:44,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:44,166 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:44,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:44,166 INFO L82 PathProgramCache]: Analyzing trace with hash 29175836, now seen corresponding path program 1 times [2019-02-25 15:53:44,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:44,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:44,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:44,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:44,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:44,341 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:44,341 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [26], [31] [2019-02-25 15:53:44,341 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:44,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:44,673 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:44,673 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:53:44,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:44,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:44,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:44,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:44,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:44,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:44,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:44,686 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:53:44,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:44,694 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:44,697 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,698 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:44,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,706 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:44,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,714 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:44,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,731 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:44,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,747 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:44,767 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:44,768 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,809 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,843 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,869 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,890 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,907 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,922 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,981 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:44,981 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,998 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,011 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,028 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,047 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,076 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,126 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:45,126 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:45,193 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,194 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:53:45,195 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,238 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:45,238 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:45,267 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,272 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:45,273 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:53:45,274 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,316 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:45,317 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:61 [2019-02-25 15:53:45,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,357 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:45,358 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:53:45,358 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,399 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:45,400 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:59 [2019-02-25 15:53:45,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:45,427 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:45,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:45,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:53:45,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:45,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:45,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:45,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:53:45,515 INFO L87 Difference]: Start difference. First operand 98 states and 536 transitions. Second operand 10 states. [2019-02-25 15:53:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:48,180 INFO L93 Difference]: Finished difference Result 140 states and 582 transitions. [2019-02-25 15:53:48,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:48,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:53:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:48,183 INFO L225 Difference]: With dead ends: 140 [2019-02-25 15:53:48,183 INFO L226 Difference]: Without dead ends: 138 [2019-02-25 15:53:48,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:53:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-25 15:53:48,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2019-02-25 15:53:48,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-25 15:53:48,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 486 transitions. [2019-02-25 15:53:48,217 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 486 transitions. Word has length 5 [2019-02-25 15:53:48,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:48,217 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 486 transitions. [2019-02-25 15:53:48,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:48,217 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 486 transitions. [2019-02-25 15:53:48,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:48,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:48,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:48,218 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:48,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:48,218 INFO L82 PathProgramCache]: Analyzing trace with hash 29191274, now seen corresponding path program 1 times [2019-02-25 15:53:48,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:48,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:48,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:48,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:48,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:48,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:48,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:48,360 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:48,360 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [28], [31] [2019-02-25 15:53:48,361 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:48,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:48,659 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:48,659 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:53:48,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:48,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:48,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:48,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:48,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:48,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:48,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:53:48,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:48,739 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:53:48,739 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,756 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,768 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,786 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,812 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,843 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,879 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:48,882 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:48,885 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:48,887 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:48,890 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:48,908 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:48,923 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:53:48,924 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,962 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,993 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:49,016 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:49,035 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:49,050 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:49,064 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:49,114 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:49,114 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:53:49,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,263 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:53:49,264 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:53:49,420 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:53:49,420 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-25 15:53:49,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,480 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,481 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:49,482 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 101 [2019-02-25 15:53:49,482 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:49,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,598 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:49,607 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 118 [2019-02-25 15:53:49,608 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-25 15:53:49,869 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-25 15:53:49,870 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:191 [2019-02-25 15:53:49,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,013 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 124 [2019-02-25 15:53:50,017 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:53:50,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,480 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,482 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,487 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:50,489 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:50,490 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 93 [2019-02-25 15:53:50,491 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:50,686 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-25 15:53:50,687 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-25 15:53:52,984 WARN L181 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-25 15:53:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:52,987 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:53,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:53,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:53:53,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:53,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:53,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:53,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:53:53,056 INFO L87 Difference]: Start difference. First operand 92 states and 486 transitions. Second operand 10 states. [2019-02-25 15:53:53,457 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2019-02-25 15:53:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:57,114 INFO L93 Difference]: Finished difference Result 155 states and 683 transitions. [2019-02-25 15:53:57,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:53:57,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:53:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:57,117 INFO L225 Difference]: With dead ends: 155 [2019-02-25 15:53:57,117 INFO L226 Difference]: Without dead ends: 154 [2019-02-25 15:53:57,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:53:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-25 15:53:57,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 98. [2019-02-25 15:53:57,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-25 15:53:57,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 534 transitions. [2019-02-25 15:53:57,158 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 534 transitions. Word has length 5 [2019-02-25 15:53:57,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:57,159 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 534 transitions. [2019-02-25 15:53:57,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:57,159 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 534 transitions. [2019-02-25 15:53:57,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:57,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:57,159 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:57,160 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:57,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:57,160 INFO L82 PathProgramCache]: Analyzing trace with hash 29193322, now seen corresponding path program 1 times [2019-02-25 15:53:57,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:57,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:57,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:57,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:57,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:57,259 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:57,259 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [32], [33] [2019-02-25 15:53:57,259 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:57,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:57,548 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:57,548 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:57,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:57,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:57,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:57,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:57,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:57,564 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:53:57,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:57,636 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:53:57,636 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,681 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,692 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,714 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,740 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,776 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,821 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,877 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:57,880 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:57,884 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:57,886 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:57,889 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:57,893 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:57,896 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:53:57,897 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,950 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:57,981 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,005 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,023 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,039 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,054 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,123 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:58,123 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:53:58,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,152 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:53:58,152 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,240 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:58,240 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:53:58,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,276 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:53:58,276 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,338 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:58,339 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:53:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:58,369 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:58,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:58,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:58,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:58,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:58,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:58,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:58,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:58,411 INFO L87 Difference]: Start difference. First operand 98 states and 534 transitions. Second operand 8 states. [2019-02-25 15:53:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:59,039 INFO L93 Difference]: Finished difference Result 137 states and 601 transitions. [2019-02-25 15:53:59,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:53:59,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:53:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:59,042 INFO L225 Difference]: With dead ends: 137 [2019-02-25 15:53:59,042 INFO L226 Difference]: Without dead ends: 132 [2019-02-25 15:53:59,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:53:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-02-25 15:53:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2019-02-25 15:53:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-25 15:53:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 556 transitions. [2019-02-25 15:53:59,093 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 556 transitions. Word has length 5 [2019-02-25 15:53:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:59,094 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 556 transitions. [2019-02-25 15:53:59,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 556 transitions. [2019-02-25 15:53:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:59,095 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:59,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:59,095 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:59,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:59,095 INFO L82 PathProgramCache]: Analyzing trace with hash 29193134, now seen corresponding path program 2 times [2019-02-25 15:53:59,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:59,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:59,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:59,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:59,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:59,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:59,249 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:53:59,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:59,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:59,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:59,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:59,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:59,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:59,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:53:59,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:53:59,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:53:59,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:53:59,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:59,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:53:59,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:59,519 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:53:59,519 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,540 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,555 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,571 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,599 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,630 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,677 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,731 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:53:59,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:53:59,737 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:53:59,740 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:53:59,745 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:53:59,747 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:53:59,762 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:53:59,763 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,817 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,846 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,867 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,886 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,901 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,916 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:59,982 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:59,983 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:54:00,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,022 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:54:00,023 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,093 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:00,093 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:54:00,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,138 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:54:00,139 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,202 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:00,203 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:54:00,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,243 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:00,244 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:54:00,245 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,303 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:00,304 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-25 15:54:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:00,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:00,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:00,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:00,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:00,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:00,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:00,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:00,397 INFO L87 Difference]: Start difference. First operand 100 states and 556 transitions. Second operand 10 states. [2019-02-25 15:54:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:01,166 INFO L93 Difference]: Finished difference Result 154 states and 681 transitions. [2019-02-25 15:54:01,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:01,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:54:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:01,169 INFO L225 Difference]: With dead ends: 154 [2019-02-25 15:54:01,169 INFO L226 Difference]: Without dead ends: 152 [2019-02-25 15:54:01,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-25 15:54:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 109. [2019-02-25 15:54:01,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:54:01,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 628 transitions. [2019-02-25 15:54:01,222 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 628 transitions. Word has length 5 [2019-02-25 15:54:01,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:01,222 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 628 transitions. [2019-02-25 15:54:01,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:01,222 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 628 transitions. [2019-02-25 15:54:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:01,223 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:01,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:01,223 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:01,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:01,224 INFO L82 PathProgramCache]: Analyzing trace with hash 29179868, now seen corresponding path program 1 times [2019-02-25 15:54:01,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:01,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:01,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:01,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:01,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:01,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:01,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:01,307 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:01,307 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [32], [33] [2019-02-25 15:54:01,307 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:01,308 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:01,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:01,528 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:01,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:01,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:01,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:01,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:01,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:01,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:01,543 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:54:01,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:01,581 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:01,581 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,612 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,629 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,651 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,690 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,723 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,762 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:01,768 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:01,771 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:01,774 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:01,777 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:01,780 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:01,801 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:01,802 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,865 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,914 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,936 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,955 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,970 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,984 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,034 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:02,034 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:02,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,086 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:02,086 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,129 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:02,130 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:02,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,162 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:54:02,162 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,205 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:02,205 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:54:02,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:02,231 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:02,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:02,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:02,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:02,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:02,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:02,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:02,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:02,273 INFO L87 Difference]: Start difference. First operand 109 states and 628 transitions. Second operand 8 states. [2019-02-25 15:54:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:02,721 INFO L93 Difference]: Finished difference Result 140 states and 686 transitions. [2019-02-25 15:54:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:02,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:54:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:02,724 INFO L225 Difference]: With dead ends: 140 [2019-02-25 15:54:02,725 INFO L226 Difference]: Without dead ends: 139 [2019-02-25 15:54:02,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-25 15:54:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2019-02-25 15:54:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-25 15:54:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 652 transitions. [2019-02-25 15:54:02,787 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 652 transitions. Word has length 5 [2019-02-25 15:54:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:02,787 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 652 transitions. [2019-02-25 15:54:02,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 652 transitions. [2019-02-25 15:54:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:02,788 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:02,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:02,789 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:02,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:02,789 INFO L82 PathProgramCache]: Analyzing trace with hash 29179680, now seen corresponding path program 1 times [2019-02-25 15:54:02,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:02,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:02,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:02,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:02,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:03,187 WARN L181 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-02-25 15:54:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:03,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:03,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:03,244 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:03,244 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [26], [31] [2019-02-25 15:54:03,245 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:03,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:03,579 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:03,579 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:03,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:03,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:03,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:03,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:03,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:03,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:03,594 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:03,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:03,598 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-02-25 15:54:03,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,603 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:03,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,610 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:03,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,625 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:03,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,640 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:03,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,653 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,655 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,657 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:03,658 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:03,671 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:03,672 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,714 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,747 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,773 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,793 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,809 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,826 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,912 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:03,913 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,930 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,942 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,961 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:03,985 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,012 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,062 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:04,063 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:04,138 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,139 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:04,139 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,182 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:04,182 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:04,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,212 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,214 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,216 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:54:04,217 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,258 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:04,259 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:54:04,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,296 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:04,297 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:54:04,297 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,338 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:04,338 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:54:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:04,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:04,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:04,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:04,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:04,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:04,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:04,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:04,423 INFO L87 Difference]: Start difference. First operand 112 states and 652 transitions. Second operand 10 states. [2019-02-25 15:54:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:05,130 INFO L93 Difference]: Finished difference Result 161 states and 770 transitions. [2019-02-25 15:54:05,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:05,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:54:05,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:05,132 INFO L225 Difference]: With dead ends: 161 [2019-02-25 15:54:05,133 INFO L226 Difference]: Without dead ends: 159 [2019-02-25 15:54:05,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-25 15:54:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2019-02-25 15:54:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-25 15:54:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 724 transitions. [2019-02-25 15:54:05,178 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 724 transitions. Word has length 5 [2019-02-25 15:54:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:05,178 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 724 transitions. [2019-02-25 15:54:05,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 724 transitions. [2019-02-25 15:54:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:05,179 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:05,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:05,179 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:05,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash 28830064, now seen corresponding path program 1 times [2019-02-25 15:54:05,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:05,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:05,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:05,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:05,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:54:05,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:05,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:05,237 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:05,237 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [32], [33] [2019-02-25 15:54:05,238 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:05,238 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:05,465 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:05,466 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:05,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:05,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:05,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:05,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:05,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:05,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:05,479 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:54:05,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:05,538 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:05,538 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,570 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,591 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,619 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,653 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,695 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,743 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:05,745 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:05,748 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:05,750 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:05,753 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:05,756 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:05,766 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:05,766 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,804 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,834 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,858 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,877 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,892 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,907 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:05,956 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:05,957 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:06,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,004 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:06,004 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:06,046 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:06,047 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:06,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,074 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,075 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:06,076 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:06,077 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:06,120 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:06,120 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-25 15:54:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:06,162 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:06,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:06,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:06,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:06,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:06,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:06,205 INFO L87 Difference]: Start difference. First operand 121 states and 724 transitions. Second operand 8 states. [2019-02-25 15:54:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:06,634 INFO L93 Difference]: Finished difference Result 156 states and 773 transitions. [2019-02-25 15:54:06,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:06,634 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:54:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:06,636 INFO L225 Difference]: With dead ends: 156 [2019-02-25 15:54:06,636 INFO L226 Difference]: Without dead ends: 154 [2019-02-25 15:54:06,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-25 15:54:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2019-02-25 15:54:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-25 15:54:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 733 transitions. [2019-02-25 15:54:06,689 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 733 transitions. Word has length 5 [2019-02-25 15:54:06,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:06,689 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 733 transitions. [2019-02-25 15:54:06,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 733 transitions. [2019-02-25 15:54:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:06,690 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:06,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:06,690 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash 28818532, now seen corresponding path program 1 times [2019-02-25 15:54:06,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:06,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:06,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:06,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:06,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:06,953 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:06,953 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [32], [33] [2019-02-25 15:54:06,954 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:06,955 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:07,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:07,513 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:07,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:07,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:07,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:07,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:07,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:07,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:07,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:07,556 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:54:07,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:07,946 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:07,947 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,964 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,971 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,983 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,005 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,036 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,073 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:08,076 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:08,078 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:08,081 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:08,083 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:08,092 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:08,100 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:08,100 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,138 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,168 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,192 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,211 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,224 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,237 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,287 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:08,288 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:08,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,333 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:08,333 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,378 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:08,379 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:08,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,407 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:08,408 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,451 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:08,451 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:54:08,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:08,468 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:08,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:08,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:54:08,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:08,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:08,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:08,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:54:08,499 INFO L87 Difference]: Start difference. First operand 123 states and 733 transitions. Second operand 8 states. [2019-02-25 15:54:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:08,879 INFO L93 Difference]: Finished difference Result 168 states and 891 transitions. [2019-02-25 15:54:08,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:08,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:54:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:08,882 INFO L225 Difference]: With dead ends: 168 [2019-02-25 15:54:08,882 INFO L226 Difference]: Without dead ends: 167 [2019-02-25 15:54:08,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-25 15:54:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2019-02-25 15:54:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-25 15:54:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 865 transitions. [2019-02-25 15:54:08,943 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 865 transitions. Word has length 5 [2019-02-25 15:54:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:08,944 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 865 transitions. [2019-02-25 15:54:08,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 865 transitions. [2019-02-25 15:54:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:08,944 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:08,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:08,944 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:08,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash 28818344, now seen corresponding path program 1 times [2019-02-25 15:54:08,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:08,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:08,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:09,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:09,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:09,031 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:09,031 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [26], [31] [2019-02-25 15:54:09,033 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:09,033 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:09,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:09,310 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:09,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:09,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:09,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:09,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:09,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:09,326 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:09,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:09,330 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:09,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,336 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:09,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,346 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:09,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,358 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:09,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,371 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:09,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,391 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:09,406 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:09,407 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,450 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,484 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,511 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,531 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,547 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,564 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,622 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:09,623 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,639 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,652 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,673 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,700 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,729 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,779 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:09,779 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:09,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,827 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:09,827 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,871 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:09,871 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:09,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,895 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,896 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,900 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:09,900 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,944 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:09,945 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:54:09,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:09,980 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:09,981 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:54:09,981 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,023 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:10,023 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:54:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:10,047 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:10,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:10,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:54:10,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:10,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:10,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:10,096 INFO L87 Difference]: Start difference. First operand 139 states and 865 transitions. Second operand 10 states. [2019-02-25 15:54:10,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:10,821 INFO L93 Difference]: Finished difference Result 242 states and 1262 transitions. [2019-02-25 15:54:10,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:54:10,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:54:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:10,825 INFO L225 Difference]: With dead ends: 242 [2019-02-25 15:54:10,825 INFO L226 Difference]: Without dead ends: 240 [2019-02-25 15:54:10,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:54:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-02-25 15:54:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 178. [2019-02-25 15:54:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-25 15:54:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 1177 transitions. [2019-02-25 15:54:10,915 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 1177 transitions. Word has length 5 [2019-02-25 15:54:10,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:10,915 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 1177 transitions. [2019-02-25 15:54:10,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:10,915 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 1177 transitions. [2019-02-25 15:54:10,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:10,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:10,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:10,916 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:10,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:10,917 INFO L82 PathProgramCache]: Analyzing trace with hash 28835830, now seen corresponding path program 1 times [2019-02-25 15:54:10,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:10,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:10,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:10,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:10,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:54:11,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:11,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:11,062 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:11,062 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [32], [33] [2019-02-25 15:54:11,063 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:11,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:11,310 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:11,311 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:11,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:11,311 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:11,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:11,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:11,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:11,320 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:11,325 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:54:11,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:11,334 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:11,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,341 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:11,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:11,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,438 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:11,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,498 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,551 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,551 INFO L292 Elim1Store]: Index analysis took 112 ms [2019-02-25 15:54:11,552 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:11,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,619 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,693 INFO L292 Elim1Store]: Index analysis took 138 ms [2019-02-25 15:54:11,694 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:11,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:11,860 INFO L292 Elim1Store]: Index analysis took 163 ms [2019-02-25 15:54:11,861 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:54:11,862 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,948 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:11,992 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,028 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,053 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,076 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,095 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,175 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:54:12,176 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,199 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,211 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,232 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,266 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,308 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,353 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,422 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:12,422 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:54:12,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,453 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:54:12,453 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,519 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:12,519 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:54:12,551 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,558 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,559 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,559 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:12,560 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:54:12,561 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,624 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:12,624 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-02-25 15:54:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:12,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:12,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:12,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:12,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:12,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:12,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:12,690 INFO L87 Difference]: Start difference. First operand 178 states and 1177 transitions. Second operand 8 states. [2019-02-25 15:54:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:15,497 INFO L93 Difference]: Finished difference Result 211 states and 1231 transitions. [2019-02-25 15:54:15,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:15,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:54:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:15,501 INFO L225 Difference]: With dead ends: 211 [2019-02-25 15:54:15,501 INFO L226 Difference]: Without dead ends: 203 [2019-02-25 15:54:15,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-25 15:54:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2019-02-25 15:54:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-02-25 15:54:15,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 1188 transitions. [2019-02-25 15:54:15,589 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 1188 transitions. Word has length 5 [2019-02-25 15:54:15,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:15,589 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 1188 transitions. [2019-02-25 15:54:15,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 1188 transitions. [2019-02-25 15:54:15,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:15,590 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:15,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:15,591 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:15,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:15,591 INFO L82 PathProgramCache]: Analyzing trace with hash 28822376, now seen corresponding path program 1 times [2019-02-25 15:54:15,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:15,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:15,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:15,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:15,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:15,774 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:54:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:54:15,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:15,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:15,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:15,784 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [32], [33] [2019-02-25 15:54:15,785 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:15,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:16,022 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:16,022 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:16,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:16,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:16,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:16,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:16,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:16,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:16,037 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:54:16,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:16,042 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:16,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,046 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:16,057 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,059 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:16,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,069 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,072 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:16,079 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,081 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,083 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,086 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:16,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,104 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:16,116 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:16,117 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,160 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,193 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,220 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,239 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,258 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,273 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,332 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:16,333 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,350 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,367 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,386 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,409 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,439 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,489 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:16,489 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:16,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,541 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:16,541 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,585 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:16,586 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:16,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:16,616 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:16,617 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:16,618 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:16,657 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:16,658 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-25 15:54:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:16,680 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:16,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:16,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:16,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:16,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:16,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:16,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:16,720 INFO L87 Difference]: Start difference. First operand 176 states and 1188 transitions. Second operand 8 states. [2019-02-25 15:54:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:17,243 INFO L93 Difference]: Finished difference Result 201 states and 1233 transitions. [2019-02-25 15:54:17,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:17,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:54:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:17,247 INFO L225 Difference]: With dead ends: 201 [2019-02-25 15:54:17,247 INFO L226 Difference]: Without dead ends: 200 [2019-02-25 15:54:17,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-02-25 15:54:17,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2019-02-25 15:54:17,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-25 15:54:17,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 1204 transitions. [2019-02-25 15:54:17,321 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 1204 transitions. Word has length 5 [2019-02-25 15:54:17,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:17,322 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 1204 transitions. [2019-02-25 15:54:17,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:17,322 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 1204 transitions. [2019-02-25 15:54:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:17,323 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:17,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:17,323 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:17,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:17,323 INFO L82 PathProgramCache]: Analyzing trace with hash 29302192, now seen corresponding path program 1 times [2019-02-25 15:54:17,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:17,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:17,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:17,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:17,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:17,466 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:54:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:17,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:17,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:17,536 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:17,537 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [31] [2019-02-25 15:54:17,537 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:17,537 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:17,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:17,821 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:17,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:17,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:17,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:17,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:17,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:17,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:17,856 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:17,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:17,879 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:17,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,922 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:17,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:18,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,068 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:18,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,120 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,123 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:18,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,138 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:18,148 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:18,149 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,211 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,243 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,270 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,290 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,307 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,323 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,396 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:18,397 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,503 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,515 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,534 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,559 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,588 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,640 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:18,640 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:18,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,704 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:18,705 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,749 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:18,749 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:18,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,782 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:18,782 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,825 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:18,826 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:54:18,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,860 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:18,861 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:54:18,861 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,902 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:18,903 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:54:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:18,925 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:18,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:18,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:18,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:18,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:18,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:18,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:18,983 INFO L87 Difference]: Start difference. First operand 178 states and 1204 transitions. Second operand 10 states. [2019-02-25 15:54:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:19,855 INFO L93 Difference]: Finished difference Result 245 states and 1358 transitions. [2019-02-25 15:54:19,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:19,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:54:19,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:19,859 INFO L225 Difference]: With dead ends: 245 [2019-02-25 15:54:19,859 INFO L226 Difference]: Without dead ends: 243 [2019-02-25 15:54:19,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-25 15:54:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 191. [2019-02-25 15:54:19,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-25 15:54:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1287 transitions. [2019-02-25 15:54:19,932 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1287 transitions. Word has length 5 [2019-02-25 15:54:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:19,933 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1287 transitions. [2019-02-25 15:54:19,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1287 transitions. [2019-02-25 15:54:19,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:19,933 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:19,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:19,934 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:19,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:19,934 INFO L82 PathProgramCache]: Analyzing trace with hash 29295188, now seen corresponding path program 1 times [2019-02-25 15:54:19,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:19,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:19,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:19,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:19,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:20,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:20,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:20,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:20,070 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [32], [33] [2019-02-25 15:54:20,071 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:20,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:20,299 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:20,300 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:20,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:20,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:20,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:20,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:20,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:20,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:54:20,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:20,365 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:20,366 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,391 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,401 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,420 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,449 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,477 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,514 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:20,517 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:20,521 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:20,525 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:20,528 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:20,530 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:20,537 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:20,538 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,578 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,609 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,633 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,652 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,668 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,681 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,731 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:20,732 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:20,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,767 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:20,767 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,812 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:20,812 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:20,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,838 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:20,838 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,882 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:20,883 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:54:20,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:20,902 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:20,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:20,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-25 15:54:20,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:20,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:20,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:20,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:54:20,927 INFO L87 Difference]: Start difference. First operand 191 states and 1287 transitions. Second operand 8 states. [2019-02-25 15:54:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:21,334 INFO L93 Difference]: Finished difference Result 343 states and 2333 transitions. [2019-02-25 15:54:21,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:21,335 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:54:21,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:21,339 INFO L225 Difference]: With dead ends: 343 [2019-02-25 15:54:21,339 INFO L226 Difference]: Without dead ends: 342 [2019-02-25 15:54:21,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:54:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-25 15:54:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 304. [2019-02-25 15:54:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-25 15:54:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 2201 transitions. [2019-02-25 15:54:21,460 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 2201 transitions. Word has length 5 [2019-02-25 15:54:21,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:21,460 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 2201 transitions. [2019-02-25 15:54:21,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:21,460 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 2201 transitions. [2019-02-25 15:54:21,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:21,461 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:21,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:21,462 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:21,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:21,462 INFO L82 PathProgramCache]: Analyzing trace with hash 29295000, now seen corresponding path program 1 times [2019-02-25 15:54:21,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:21,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:21,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:21,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:21,605 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-02-25 15:54:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:21,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:21,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:21,644 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:21,644 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [26], [31] [2019-02-25 15:54:21,645 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:21,645 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:21,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:21,982 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:21,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:21,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:21,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:21,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:21,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:21,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:21,999 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:21,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:22,004 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:22,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,009 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:22,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,018 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:22,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,030 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:22,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,042 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:22,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,055 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,057 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,058 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:22,073 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:22,074 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,125 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,166 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,205 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,228 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,254 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,275 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,349 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:22,349 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,373 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,380 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,395 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,416 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,445 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,495 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:22,496 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:22,562 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,563 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:22,563 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,606 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:22,606 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:22,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,640 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:22,641 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,684 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:22,685 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:54:22,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,718 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,720 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,723 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,724 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,725 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:22,726 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:54:22,726 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:22,770 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:22,771 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:54:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:22,794 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:22,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:22,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:22,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:22,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:22,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:22,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:22,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:22,857 INFO L87 Difference]: Start difference. First operand 304 states and 2201 transitions. Second operand 10 states. [2019-02-25 15:54:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:24,619 INFO L93 Difference]: Finished difference Result 369 states and 2390 transitions. [2019-02-25 15:54:24,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:24,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:54:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:24,625 INFO L225 Difference]: With dead ends: 369 [2019-02-25 15:54:24,625 INFO L226 Difference]: Without dead ends: 367 [2019-02-25 15:54:24,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-02-25 15:54:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 320. [2019-02-25 15:54:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-02-25 15:54:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 2329 transitions. [2019-02-25 15:54:24,776 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 2329 transitions. Word has length 5 [2019-02-25 15:54:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:24,776 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 2329 transitions. [2019-02-25 15:54:24,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 2329 transitions. [2019-02-25 15:54:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:24,777 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:24,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:24,778 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:24,778 INFO L82 PathProgramCache]: Analyzing trace with hash 29312486, now seen corresponding path program 1 times [2019-02-25 15:54:24,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:24,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:24,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:24,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:24,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:25,246 WARN L181 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-02-25 15:54:25,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:25,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:25,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:25,350 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:25,350 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [32], [33] [2019-02-25 15:54:25,350 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:25,351 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:25,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:25,583 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:25,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:25,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:25,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:25,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:25,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:25,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:25,600 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:54:25,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:25,675 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:54:25,676 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,703 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,717 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,742 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,777 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,817 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,871 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,927 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:25,930 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:25,933 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:25,936 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:25,938 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:25,941 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:25,943 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:54:25,944 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,996 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:26,027 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:26,051 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:26,070 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:26,086 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:26,100 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:26,170 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:26,171 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:54:26,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:26,199 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:54:26,200 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:26,265 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:26,265 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:54:26,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:26,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:26,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:26,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:26,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:26,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:26,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:26,299 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:26,300 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:54:26,301 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:26,363 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:26,363 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-02-25 15:54:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:26,397 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:26,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:26,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:26,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:26,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:26,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:26,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:26,438 INFO L87 Difference]: Start difference. First operand 320 states and 2329 transitions. Second operand 8 states. [2019-02-25 15:54:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:27,092 INFO L93 Difference]: Finished difference Result 354 states and 2377 transitions. [2019-02-25 15:54:27,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:27,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:54:27,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:27,097 INFO L225 Difference]: With dead ends: 354 [2019-02-25 15:54:27,098 INFO L226 Difference]: Without dead ends: 350 [2019-02-25 15:54:27,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-02-25 15:54:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 323. [2019-02-25 15:54:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-02-25 15:54:27,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 2346 transitions. [2019-02-25 15:54:27,220 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 2346 transitions. Word has length 5 [2019-02-25 15:54:27,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:27,221 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 2346 transitions. [2019-02-25 15:54:27,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 2346 transitions. [2019-02-25 15:54:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:27,221 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:27,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:27,222 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash 29299032, now seen corresponding path program 1 times [2019-02-25 15:54:27,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:27,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:27,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:27,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:27,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:27,402 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2019-02-25 15:54:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:27,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:27,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:27,422 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:27,422 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [32], [33] [2019-02-25 15:54:27,423 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:27,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:27,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:27,738 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:27,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:27,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:27,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:27,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:27,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:27,771 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:54:27,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:27,787 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:27,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,833 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:27,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,893 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:27,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,979 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:28,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,049 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:28,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,054 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,055 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,058 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:28,072 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:28,072 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,139 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,174 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,200 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,220 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,237 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,253 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,312 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:28,313 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,326 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,333 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,346 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,365 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,394 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,443 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:28,444 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:28,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,487 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:28,487 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,532 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:28,532 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:28,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,557 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,558 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,559 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,560 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:28,561 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:28,561 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,602 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:28,602 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-25 15:54:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:28,624 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:28,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:28,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:28,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:28,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:28,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:28,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:28,665 INFO L87 Difference]: Start difference. First operand 323 states and 2346 transitions. Second operand 8 states. [2019-02-25 15:54:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:29,302 INFO L93 Difference]: Finished difference Result 347 states and 2375 transitions. [2019-02-25 15:54:29,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:29,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:54:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:29,307 INFO L225 Difference]: With dead ends: 347 [2019-02-25 15:54:29,308 INFO L226 Difference]: Without dead ends: 346 [2019-02-25 15:54:29,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-02-25 15:54:29,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 324. [2019-02-25 15:54:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-02-25 15:54:29,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 2354 transitions. [2019-02-25 15:54:29,456 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 2354 transitions. Word has length 5 [2019-02-25 15:54:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:29,456 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 2354 transitions. [2019-02-25 15:54:29,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 2354 transitions. [2019-02-25 15:54:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:29,458 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:29,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:29,458 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:29,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:29,458 INFO L82 PathProgramCache]: Analyzing trace with hash 28958902, now seen corresponding path program 1 times [2019-02-25 15:54:29,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:29,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:29,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:29,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:29,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:29,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:29,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:29,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:29,527 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:29,528 INFO L207 CegarAbsIntRunner]: [0], [10], [32], [34], [35] [2019-02-25 15:54:29,529 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:29,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:29,690 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:29,690 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:54:29,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:29,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:29,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:29,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:29,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:29,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:29,706 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:54:29,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:29,769 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:29,770 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,797 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,810 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,827 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,855 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,899 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,943 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:29,947 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:29,950 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:29,952 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:29,955 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:29,958 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:29,966 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:29,966 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,005 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,036 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,059 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,078 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,116 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,130 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,179 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:30,180 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:30,214 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,215 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:30,215 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,260 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:30,261 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:30,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:30,283 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:30,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:30,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:54:30,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:30,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:54:30,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:54:30,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:54:30,312 INFO L87 Difference]: Start difference. First operand 324 states and 2354 transitions. Second operand 6 states. [2019-02-25 15:54:30,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:30,620 INFO L93 Difference]: Finished difference Result 344 states and 2373 transitions. [2019-02-25 15:54:30,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:54:30,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-25 15:54:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:30,626 INFO L225 Difference]: With dead ends: 344 [2019-02-25 15:54:30,626 INFO L226 Difference]: Without dead ends: 343 [2019-02-25 15:54:30,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:54:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-02-25 15:54:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 324. [2019-02-25 15:54:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-02-25 15:54:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 2354 transitions. [2019-02-25 15:54:30,745 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 2354 transitions. Word has length 5 [2019-02-25 15:54:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:30,745 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 2354 transitions. [2019-02-25 15:54:30,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:54:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 2354 transitions. [2019-02-25 15:54:30,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:30,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:30,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:30,746 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:30,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:30,747 INFO L82 PathProgramCache]: Analyzing trace with hash 28945258, now seen corresponding path program 1 times [2019-02-25 15:54:30,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:30,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:30,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:30,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:30,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:31,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:31,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:31,034 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:31,034 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [31] [2019-02-25 15:54:31,035 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:31,035 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:31,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:31,327 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:31,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:31,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:31,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:31,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:31,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:31,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:31,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:31,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:31,348 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:31,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,352 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:31,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,362 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:31,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,375 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:31,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,390 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:31,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,409 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:31,420 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:31,421 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,463 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,497 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,522 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,542 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,559 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,573 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,632 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:31,633 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,654 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,671 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,692 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,715 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,744 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,793 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:31,793 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:31,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,841 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:54:31,842 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:31,997 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:54:31,997 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-25 15:54:32,068 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,070 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,079 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,081 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,082 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:32,091 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 106 [2019-02-25 15:54:32,092 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:32,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,330 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:32,330 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 117 [2019-02-25 15:54:32,331 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:32,515 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-25 15:54:32,516 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:191 [2019-02-25 15:54:32,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,605 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,614 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:32,679 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 140 [2019-02-25 15:54:32,682 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:54:33,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,170 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:33,178 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:33,179 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 97 [2019-02-25 15:54:33,179 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:33,384 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-25 15:54:33,384 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-25 15:54:40,012 WARN L181 SmtUtils]: Spent 6.56 s on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-25 15:54:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:40,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:40,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:40,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:40,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:54:40,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:40,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:40,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:40,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:40,084 INFO L87 Difference]: Start difference. First operand 324 states and 2354 transitions. Second operand 10 states. [2019-02-25 15:54:42,271 WARN L181 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-02-25 15:54:43,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:43,945 INFO L93 Difference]: Finished difference Result 434 states and 2876 transitions. [2019-02-25 15:54:43,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:54:43,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:54:43,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:43,952 INFO L225 Difference]: With dead ends: 434 [2019-02-25 15:54:43,952 INFO L226 Difference]: Without dead ends: 432 [2019-02-25 15:54:43,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:54:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-02-25 15:54:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 339. [2019-02-25 15:54:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-02-25 15:54:44,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 2453 transitions. [2019-02-25 15:54:44,077 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 2453 transitions. Word has length 5 [2019-02-25 15:54:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:44,077 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 2453 transitions. [2019-02-25 15:54:44,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 2453 transitions. [2019-02-25 15:54:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:44,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:44,078 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:44,078 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:44,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:44,078 INFO L82 PathProgramCache]: Analyzing trace with hash 28933852, now seen corresponding path program 2 times [2019-02-25 15:54:44,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:44,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:44,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:44,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:44,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:44,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:44,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:44,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:44,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:44,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:44,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:44,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:54:44,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:44,155 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:54:44,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:44,162 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:44,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,166 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:44,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,174 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:44,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,185 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:44,193 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,196 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:44,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,208 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:44,212 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,214 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,216 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,220 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:54:44,221 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,282 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,317 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,344 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,365 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,384 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,399 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,472 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:54:44,473 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,678 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,690 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,709 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,732 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,762 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,807 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,878 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:44,878 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-02-25 15:54:44,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,903 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:54:44,903 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:44,971 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:44,972 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:54:44,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:44,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:45,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:45,001 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:54:45,002 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:45,067 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:45,068 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:54:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:45,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:45,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:45,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:54:45,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:45,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:45,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:45,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:54:45,119 INFO L87 Difference]: Start difference. First operand 339 states and 2453 transitions. Second operand 8 states. [2019-02-25 15:54:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:46,291 INFO L93 Difference]: Finished difference Result 472 states and 3201 transitions. [2019-02-25 15:54:46,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:54:46,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:54:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:46,297 INFO L225 Difference]: With dead ends: 472 [2019-02-25 15:54:46,297 INFO L226 Difference]: Without dead ends: 471 [2019-02-25 15:54:46,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-02-25 15:54:46,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 396. [2019-02-25 15:54:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-02-25 15:54:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 2917 transitions. [2019-02-25 15:54:46,438 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 2917 transitions. Word has length 5 [2019-02-25 15:54:46,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:46,438 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 2917 transitions. [2019-02-25 15:54:46,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:46,438 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 2917 transitions. [2019-02-25 15:54:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:46,439 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:46,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:46,439 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:46,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:46,439 INFO L82 PathProgramCache]: Analyzing trace with hash 28952946, now seen corresponding path program 1 times [2019-02-25 15:54:46,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:46,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:46,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:46,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:46,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:46,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:46,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:46,665 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:46,665 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [28], [31] [2019-02-25 15:54:46,670 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:46,670 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:46,971 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:46,971 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:46,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:46,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:46,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:46,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:46,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:46,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:46,985 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:46,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:46,994 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:47,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,001 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:47,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:47,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,023 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:47,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,032 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,037 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:47,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,054 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:47,068 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:47,069 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,107 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,141 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,168 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,188 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,204 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,220 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,281 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:47,282 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,298 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,309 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,326 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,353 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,383 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,433 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:47,433 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:47,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,489 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:54:47,490 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:47,665 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:54:47,665 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-25 15:54:47,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,744 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:47,744 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 109 [2019-02-25 15:54:47,745 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:47,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,872 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:47,876 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:47,886 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 114 [2019-02-25 15:54:47,887 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:48,085 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-25 15:54:48,086 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:191 [2019-02-25 15:54:48,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,193 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,224 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 124 [2019-02-25 15:54:48,229 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:54:48,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,641 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:48,649 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:48,650 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 101 [2019-02-25 15:54:48,650 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:48,851 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-25 15:54:48,851 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-25 15:54:49,132 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-25 15:54:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:49,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:49,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:49,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:54:49,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:49,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:49,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:49,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:49,201 INFO L87 Difference]: Start difference. First operand 396 states and 2917 transitions. Second operand 10 states. [2019-02-25 15:54:49,360 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2019-02-25 15:54:49,521 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2019-02-25 15:54:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:50,694 INFO L93 Difference]: Finished difference Result 485 states and 3298 transitions. [2019-02-25 15:54:50,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:54:50,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:54:50,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:50,702 INFO L225 Difference]: With dead ends: 485 [2019-02-25 15:54:50,702 INFO L226 Difference]: Without dead ends: 484 [2019-02-25 15:54:50,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:54:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-02-25 15:54:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 400. [2019-02-25 15:54:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-02-25 15:54:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 2949 transitions. [2019-02-25 15:54:50,897 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 2949 transitions. Word has length 5 [2019-02-25 15:54:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:50,897 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 2949 transitions. [2019-02-25 15:54:50,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 2949 transitions. [2019-02-25 15:54:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:50,898 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:50,898 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:50,899 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:50,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:50,899 INFO L82 PathProgramCache]: Analyzing trace with hash 28954558, now seen corresponding path program 2 times [2019-02-25 15:54:50,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:50,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:50,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:50,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:50,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:51,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:51,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:51,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:51,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:51,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:51,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:51,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:51,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:51,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:54:51,046 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:51,046 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:54:51,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:51,052 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:51,057 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,057 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:51,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,067 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:51,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,074 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,076 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:51,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,081 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,083 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,084 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,085 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:51,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,095 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:51,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,108 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:54:51,109 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,168 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,201 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,229 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,248 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,267 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,284 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,356 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:54:51,356 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,377 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,390 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,409 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,436 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,476 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,520 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,588 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:51,588 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:54:51,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,627 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:54:51,628 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,694 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:51,694 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:54:51,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,736 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:54:51,736 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,798 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:51,798 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:54:51,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:51,843 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:51,844 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:54:51,844 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:51,904 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:51,905 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-25 15:54:51,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:51,932 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:51,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:51,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:51,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:51,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:51,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:51,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:51,989 INFO L87 Difference]: Start difference. First operand 400 states and 2949 transitions. Second operand 10 states. [2019-02-25 15:54:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:53,001 INFO L93 Difference]: Finished difference Result 485 states and 3293 transitions. [2019-02-25 15:54:53,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:53,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:54:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:53,008 INFO L225 Difference]: With dead ends: 485 [2019-02-25 15:54:53,008 INFO L226 Difference]: Without dead ends: 480 [2019-02-25 15:54:53,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-02-25 15:54:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 435. [2019-02-25 15:54:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-02-25 15:54:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 3230 transitions. [2019-02-25 15:54:53,164 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 3230 transitions. Word has length 5 [2019-02-25 15:54:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:53,164 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 3230 transitions. [2019-02-25 15:54:53,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 3230 transitions. [2019-02-25 15:54:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:53,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:53,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:53,167 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:53,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:53,167 INFO L82 PathProgramCache]: Analyzing trace with hash 28954806, now seen corresponding path program 2 times [2019-02-25 15:54:53,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:53,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:53,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:53,334 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:54:53,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:53,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:53,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:53,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:53,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:53,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:53,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:53,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:53,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:53,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:54:53,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:53,377 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:54:53,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:53,384 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:53,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,388 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:53,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,399 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:53,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,409 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:53,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,422 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:53,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,434 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:53,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,448 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:54:53,449 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,506 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,537 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,563 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,582 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,599 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,615 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,689 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:54:53,689 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,713 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,728 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,748 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,769 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,803 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,848 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,918 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:53,918 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:54:53,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,958 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:54:53,958 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:54,024 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:54,024 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:54:54,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,098 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:54:54,098 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:54,160 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:54,161 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:54:54,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,194 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,196 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,203 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:54,206 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:54,207 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:54:54,208 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:54,267 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:54,268 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-25 15:54:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:54,292 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:54,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:54,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:54,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:54,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:54,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:54,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:54,354 INFO L87 Difference]: Start difference. First operand 435 states and 3230 transitions. Second operand 10 states. [2019-02-25 15:54:55,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:55,162 INFO L93 Difference]: Finished difference Result 501 states and 3456 transitions. [2019-02-25 15:54:55,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:55,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:54:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:55,169 INFO L225 Difference]: With dead ends: 501 [2019-02-25 15:54:55,169 INFO L226 Difference]: Without dead ends: 499 [2019-02-25 15:54:55,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-02-25 15:54:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 457. [2019-02-25 15:54:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-02-25 15:54:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 3406 transitions. [2019-02-25 15:54:55,317 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 3406 transitions. Word has length 5 [2019-02-25 15:54:55,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:55,317 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 3406 transitions. [2019-02-25 15:54:55,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 3406 transitions. [2019-02-25 15:54:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:55,318 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:55,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:55,319 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:55,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:55,319 INFO L82 PathProgramCache]: Analyzing trace with hash 28941104, now seen corresponding path program 1 times [2019-02-25 15:54:55,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:55,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:55,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:55,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:55,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:55,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:55,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:55,418 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:55,418 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [31] [2019-02-25 15:54:55,419 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:55,419 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:55,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:55,705 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:55,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:55,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:55,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:55,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:55,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:55,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:55,721 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:55,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:55,726 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:55,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:55,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,745 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:55,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,758 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:55,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,770 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:55,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,783 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:55,798 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:55,799 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,845 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,878 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,908 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,932 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,978 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,996 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,055 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:56,055 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,070 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,076 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,088 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,105 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,134 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,184 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:56,185 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:56,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,246 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:56,247 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,293 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:56,293 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:56,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,368 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:54:56,368 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,409 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:56,409 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:54:56,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,450 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:56,451 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:54:56,451 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,492 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:56,492 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:54:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:56,513 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:56,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:56,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:56,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:56,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:56,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:56,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:56,572 INFO L87 Difference]: Start difference. First operand 457 states and 3406 transitions. Second operand 10 states. [2019-02-25 15:54:57,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:57,500 INFO L93 Difference]: Finished difference Result 539 states and 3726 transitions. [2019-02-25 15:54:57,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:57,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:54:57,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:57,507 INFO L225 Difference]: With dead ends: 539 [2019-02-25 15:54:57,507 INFO L226 Difference]: Without dead ends: 537 [2019-02-25 15:54:57,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:57,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-02-25 15:54:57,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 492. [2019-02-25 15:54:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-02-25 15:54:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 3666 transitions. [2019-02-25 15:54:57,678 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 3666 transitions. Word has length 5 [2019-02-25 15:54:57,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:57,678 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 3666 transitions. [2019-02-25 15:54:57,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:57,678 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 3666 transitions. [2019-02-25 15:54:57,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:57,679 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:57,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:57,679 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:57,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:57,680 INFO L82 PathProgramCache]: Analyzing trace with hash 28941352, now seen corresponding path program 1 times [2019-02-25 15:54:57,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:57,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:57,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:57,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:57,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:57,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:57,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:57,790 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:57,790 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [26], [31] [2019-02-25 15:54:57,791 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:57,791 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:58,076 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:58,076 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:58,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:58,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:58,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:58,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:58,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:58,091 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:58,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:58,136 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:54:58,136 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,158 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,178 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,202 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,232 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,266 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,301 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:54:58,305 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:54:58,308 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:54:58,311 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:54:58,315 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:54:58,318 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:54:58,329 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:54:58,329 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,368 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,399 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,422 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,441 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,457 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,472 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,522 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:58,522 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:54:58,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,587 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:58,587 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,632 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:58,632 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:58,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,668 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,672 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:54:58,673 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,716 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:58,716 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:54:58,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:58,784 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:58,785 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:54:58,785 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:58,826 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:58,826 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:54:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:58,850 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:58,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:58,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:58,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:58,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:58,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:58,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:58,909 INFO L87 Difference]: Start difference. First operand 492 states and 3666 transitions. Second operand 10 states. [2019-02-25 15:54:59,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:59,685 INFO L93 Difference]: Finished difference Result 551 states and 3869 transitions. [2019-02-25 15:54:59,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:59,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:54:59,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:59,696 INFO L225 Difference]: With dead ends: 551 [2019-02-25 15:54:59,697 INFO L226 Difference]: Without dead ends: 549 [2019-02-25 15:54:59,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-02-25 15:54:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 509. [2019-02-25 15:54:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-25 15:54:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3822 transitions. [2019-02-25 15:54:59,855 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3822 transitions. Word has length 5 [2019-02-25 15:54:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:59,855 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3822 transitions. [2019-02-25 15:54:59,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3822 transitions. [2019-02-25 15:54:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:54:59,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:59,857 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:54:59,857 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:59,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:59,857 INFO L82 PathProgramCache]: Analyzing trace with hash 29435558, now seen corresponding path program 1 times [2019-02-25 15:54:59,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:59,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:59,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:59,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:59,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:59,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:59,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:59,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:59,891 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:54:59,891 INFO L207 CegarAbsIntRunner]: [0], [26], [32], [34], [35] [2019-02-25 15:54:59,892 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:59,893 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:00,043 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:00,043 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:55:00,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:00,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:00,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:00,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:00,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:00,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:00,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:55:00,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:00,273 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:55:00,273 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,286 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,304 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,328 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,354 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,383 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:00,387 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:00,392 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-25 15:55:00,396 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-25 15:55:00,401 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-25 15:55:00,406 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-25 15:55:00,417 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-25 15:55:00,418 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,454 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,480 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,501 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,516 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,532 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,602 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,646 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:00,646 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:84, output treesize:88 [2019-02-25 15:55:00,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:00,686 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-25 15:55:00,687 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:00,727 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:00,727 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:63 [2019-02-25 15:55:00,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:00,750 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:00,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:00,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:55:00,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:00,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:55:00,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:55:00,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:55:00,781 INFO L87 Difference]: Start difference. First operand 509 states and 3822 transitions. Second operand 6 states. [2019-02-25 15:55:01,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:01,170 INFO L93 Difference]: Finished difference Result 523 states and 3832 transitions. [2019-02-25 15:55:01,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:55:01,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-25 15:55:01,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:01,176 INFO L225 Difference]: With dead ends: 523 [2019-02-25 15:55:01,176 INFO L226 Difference]: Without dead ends: 522 [2019-02-25 15:55:01,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:55:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-02-25 15:55:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 509. [2019-02-25 15:55:01,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-25 15:55:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3821 transitions. [2019-02-25 15:55:01,335 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3821 transitions. Word has length 5 [2019-02-25 15:55:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:01,335 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3821 transitions. [2019-02-25 15:55:01,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:55:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3821 transitions. [2019-02-25 15:55:01,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:55:01,336 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:01,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:55:01,337 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:01,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:01,337 INFO L82 PathProgramCache]: Analyzing trace with hash 29425884, now seen corresponding path program 1 times [2019-02-25 15:55:01,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:01,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:01,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:01,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:01,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:01,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:01,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:01,484 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:55:01,484 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [32], [33] [2019-02-25 15:55:01,485 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:01,485 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:01,722 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:01,722 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:55:01,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:01,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:01,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:01,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:01,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:01,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:01,737 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:55:01,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:01,842 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:55:01,842 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:01,860 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:01,871 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:01,890 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:01,919 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:01,950 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:01,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:01,990 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:01,992 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:01,994 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:01,997 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:01,999 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:02,006 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:55:02,007 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,044 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,075 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,099 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,119 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,134 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,149 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,199 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:02,199 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:55:02,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,250 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:55:02,250 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,294 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:02,294 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:55:02,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,327 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:55:02,328 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,371 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:02,372 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:55:02,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:02,395 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:02,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:02,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:02,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:55:02,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:02,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:02,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:02,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:02,437 INFO L87 Difference]: Start difference. First operand 509 states and 3821 transitions. Second operand 8 states. [2019-02-25 15:55:03,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:03,127 INFO L93 Difference]: Finished difference Result 542 states and 3850 transitions. [2019-02-25 15:55:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:55:03,127 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:55:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:03,131 INFO L225 Difference]: With dead ends: 542 [2019-02-25 15:55:03,131 INFO L226 Difference]: Without dead ends: 540 [2019-02-25 15:55:03,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:55:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-02-25 15:55:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 509. [2019-02-25 15:55:03,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-25 15:55:03,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3820 transitions. [2019-02-25 15:55:03,292 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3820 transitions. Word has length 5 [2019-02-25 15:55:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:03,293 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3820 transitions. [2019-02-25 15:55:03,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3820 transitions. [2019-02-25 15:55:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:55:03,294 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:03,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:55:03,294 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:03,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash 29431650, now seen corresponding path program 1 times [2019-02-25 15:55:03,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:03,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:03,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:03,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:03,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:03,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:03,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:03,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:03,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:55:03,343 INFO L207 CegarAbsIntRunner]: [0], [26], [28], [32], [33] [2019-02-25 15:55:03,344 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:03,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:03,572 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:03,572 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:55:03,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:03,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:03,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:03,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:03,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:03,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:03,594 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:55:03,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:03,601 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:03,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,607 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:03,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,617 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:03,623 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,628 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:03,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:03,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,659 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:03,663 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,668 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:03,670 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:55:03,671 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:03,768 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:03,799 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:03,826 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:03,847 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:03,865 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:03,882 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:03,957 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:03,957 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:03,981 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:03,996 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,019 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,053 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,090 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,135 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,204 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:04,204 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:55:04,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,233 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:04,233 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,301 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:04,301 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:04,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,331 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:04,339 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:04,340 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:04,401 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:04,402 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:55:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:04,438 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:04,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:04,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:55:04,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:04,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:04,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:04,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:04,481 INFO L87 Difference]: Start difference. First operand 509 states and 3820 transitions. Second operand 8 states. [2019-02-25 15:55:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:05,256 INFO L93 Difference]: Finished difference Result 541 states and 3851 transitions. [2019-02-25 15:55:05,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:55:05,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:55:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:05,261 INFO L225 Difference]: With dead ends: 541 [2019-02-25 15:55:05,261 INFO L226 Difference]: Without dead ends: 540 [2019-02-25 15:55:05,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:05,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-02-25 15:55:05,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 509. [2019-02-25 15:55:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-25 15:55:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3820 transitions. [2019-02-25 15:55:05,427 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3820 transitions. Word has length 5 [2019-02-25 15:55:05,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:05,427 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3820 transitions. [2019-02-25 15:55:05,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:05,427 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3820 transitions. [2019-02-25 15:55:05,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:55:05,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:05,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:55:05,429 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:05,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:05,429 INFO L82 PathProgramCache]: Analyzing trace with hash 29418196, now seen corresponding path program 1 times [2019-02-25 15:55:05,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:05,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:05,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:05,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:05,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:05,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:05,553 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:55:05,553 INFO L207 CegarAbsIntRunner]: [0], [14], [26], [32], [33] [2019-02-25 15:55:05,554 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:05,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:05,764 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:05,764 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:55:05,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:05,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:05,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:05,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:05,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:05,773 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:05,778 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:55:05,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:05,833 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:55:05,834 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:05,857 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:05,872 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:05,890 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:05,916 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:05,947 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:05,984 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:05,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:05,991 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:05,993 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:05,997 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:05,999 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:06,008 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:55:06,009 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,047 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,078 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,101 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,120 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,136 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,151 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,201 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:06,201 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:55:08,255 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-25 15:55:08,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,261 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:55:08,261 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,308 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:08,308 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:55:08,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,342 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,348 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:55:08,348 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,391 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:08,391 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:55:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:08,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:08,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:08,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:55:08,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:08,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:08,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:08,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:55:08,460 INFO L87 Difference]: Start difference. First operand 509 states and 3820 transitions. Second operand 8 states. [2019-02-25 15:55:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:09,131 INFO L93 Difference]: Finished difference Result 573 states and 3948 transitions. [2019-02-25 15:55:09,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:55:09,132 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:55:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:09,136 INFO L225 Difference]: With dead ends: 573 [2019-02-25 15:55:09,136 INFO L226 Difference]: Without dead ends: 572 [2019-02-25 15:55:09,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:55:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-02-25 15:55:09,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 517. [2019-02-25 15:55:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-02-25 15:55:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 3892 transitions. [2019-02-25 15:55:09,300 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 3892 transitions. Word has length 5 [2019-02-25 15:55:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:09,300 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 3892 transitions. [2019-02-25 15:55:09,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 3892 transitions. [2019-02-25 15:55:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:55:09,301 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:09,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:55:09,302 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:09,302 INFO L82 PathProgramCache]: Analyzing trace with hash 29477778, now seen corresponding path program 1 times [2019-02-25 15:55:09,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:09,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:09,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:09,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:09,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:09,398 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:55:09,398 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [32], [33] [2019-02-25 15:55:09,398 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:09,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:09,896 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:09,896 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:55:09,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:09,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:09,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:09,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:09,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:09,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:09,910 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:55:09,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:09,983 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:09,983 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,017 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,041 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,072 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,106 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,151 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,204 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,264 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:10,267 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:10,270 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:10,273 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:10,275 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:10,278 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:10,280 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:55:10,281 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,333 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,364 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,388 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,407 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,422 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,436 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,506 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:10,506 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:55:10,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:10,535 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:10,536 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,600 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:10,600 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:10,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:10,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:10,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:10,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:10,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:10,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:10,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:10,633 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:10,634 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:10,635 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:10,698 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:10,699 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-02-25 15:55:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:10,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:10,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:10,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:55:10,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:10,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:10,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:10,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:10,778 INFO L87 Difference]: Start difference. First operand 517 states and 3892 transitions. Second operand 8 states. [2019-02-25 15:55:11,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:11,400 INFO L93 Difference]: Finished difference Result 560 states and 3946 transitions. [2019-02-25 15:55:11,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:55:11,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:55:11,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:11,404 INFO L225 Difference]: With dead ends: 560 [2019-02-25 15:55:11,404 INFO L226 Difference]: Without dead ends: 557 [2019-02-25 15:55:11,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:55:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-02-25 15:55:11,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 522. [2019-02-25 15:55:11,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-02-25 15:55:11,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 3906 transitions. [2019-02-25 15:55:11,570 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 3906 transitions. Word has length 5 [2019-02-25 15:55:11,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:11,570 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 3906 transitions. [2019-02-25 15:55:11,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:11,570 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 3906 transitions. [2019-02-25 15:55:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:11,571 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:11,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:11,572 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:11,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:11,572 INFO L82 PathProgramCache]: Analyzing trace with hash 905114198, now seen corresponding path program 1 times [2019-02-25 15:55:11,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:11,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:11,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:11,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:11,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:11,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:11,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:11,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:11,676 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [34], [36], [37] [2019-02-25 15:55:11,676 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:11,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:11,826 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:11,826 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:55:11,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:11,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:11,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:11,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:11,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:11,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:11,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:55:11,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:11,850 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:11,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,855 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:11,871 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-25 15:55:11,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,888 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-25 15:55:11,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,904 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-25 15:55:11,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:11,919 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-25 15:55:11,931 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-25 15:55:11,932 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,966 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,996 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,019 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,035 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,053 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,069 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,160 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:55:12,161 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,174 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,186 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,202 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,226 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,270 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:12,271 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:84, output treesize:88 [2019-02-25 15:55:12,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,372 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-25 15:55:12,373 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,644 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:12,645 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:63 [2019-02-25 15:55:12,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:12,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:12,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:55:12,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:55:12,684 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:55:12,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:55:12,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:55:12,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:55:12,685 INFO L87 Difference]: Start difference. First operand 522 states and 3906 transitions. Second operand 4 states. [2019-02-25 15:55:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:13,005 INFO L93 Difference]: Finished difference Result 806 states and 6051 transitions. [2019-02-25 15:55:13,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:55:13,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-25 15:55:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:13,011 INFO L225 Difference]: With dead ends: 806 [2019-02-25 15:55:13,011 INFO L226 Difference]: Without dead ends: 802 [2019-02-25 15:55:13,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:55:13,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-02-25 15:55:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 783. [2019-02-25 15:55:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-02-25 15:55:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 6028 transitions. [2019-02-25 15:55:13,308 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 6028 transitions. Word has length 6 [2019-02-25 15:55:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:13,308 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 6028 transitions. [2019-02-25 15:55:13,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:55:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 6028 transitions. [2019-02-25 15:55:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:13,310 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:13,310 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:55:13,310 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash 904695138, now seen corresponding path program 2 times [2019-02-25 15:55:13,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:13,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:13,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:13,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:13,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:13,518 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2019-02-25 15:55:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:55:13,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:13,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:13,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:13,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:13,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:13,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:13,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:55:13,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:55:13,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:55:13,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:13,546 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:55:13,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:13,551 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:13,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,554 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:13,560 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-25 15:55:13,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,571 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-25 15:55:13,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,583 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-25 15:55:13,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,596 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-25 15:55:13,600 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,609 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 112 [2019-02-25 15:55:13,610 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,665 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,695 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,719 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,735 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,770 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,785 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,869 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:55:13,870 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:14,062 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:14,077 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:14,095 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:14,158 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:14,197 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:14,260 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:14,261 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:107, output treesize:112 [2019-02-25 15:55:14,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:14,284 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 112 [2019-02-25 15:55:14,285 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:14,346 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:14,346 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:122, output treesize:88 [2019-02-25 15:55:14,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:14,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:14,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:14,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:14,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:14,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:14,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:14,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:14,377 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 112 [2019-02-25 15:55:14,378 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:14,438 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:14,439 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:100, output treesize:88 [2019-02-25 15:55:14,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:14,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:14,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:14,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-25 15:55:14,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:14,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:55:14,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:55:14,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:55:14,498 INFO L87 Difference]: Start difference. First operand 783 states and 6028 transitions. Second operand 7 states. [2019-02-25 15:55:15,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:15,165 INFO L93 Difference]: Finished difference Result 802 states and 6046 transitions. [2019-02-25 15:55:15,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:55:15,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-25 15:55:15,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:15,171 INFO L225 Difference]: With dead ends: 802 [2019-02-25 15:55:15,171 INFO L226 Difference]: Without dead ends: 801 [2019-02-25 15:55:15,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:15,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-02-25 15:55:15,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 783. [2019-02-25 15:55:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-02-25 15:55:15,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 6028 transitions. [2019-02-25 15:55:15,422 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 6028 transitions. Word has length 6 [2019-02-25 15:55:15,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:15,423 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 6028 transitions. [2019-02-25 15:55:15,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:55:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 6028 transitions. [2019-02-25 15:55:15,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:15,424 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:15,425 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:55:15,425 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash 904669900, now seen corresponding path program 1 times [2019-02-25 15:55:15,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:15,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:15,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:15,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:15,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:55:15,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:15,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:15,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:15,538 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [26], [31] [2019-02-25 15:55:15,538 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:15,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:15,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:15,820 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:55:15,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:15,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:15,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:15,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:15,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:15,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:15,835 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:55:15,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:15,851 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:15,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,858 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:15,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,867 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:15,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,880 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:15,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,894 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:15,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,908 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,911 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:15,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:15,927 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:55:15,927 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:15,986 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,020 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,045 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,064 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,083 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,099 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,173 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:16,174 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,199 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,216 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,235 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,275 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,315 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,360 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,430 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:16,430 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:55:16,460 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,460 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:16,461 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,527 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:16,527 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:16,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,557 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,558 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,559 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,560 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,561 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 120 [2019-02-25 15:55:16,562 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,628 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:16,628 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:96 [2019-02-25 15:55:16,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,662 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,663 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,666 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:16,667 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,730 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:16,730 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:55:16,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,871 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,873 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:16,882 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:16,882 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:16,942 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:16,943 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-02-25 15:55:16,970 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:16,970 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:17,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:17,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:55:17,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:17,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:55:17,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:55:17,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:55:17,030 INFO L87 Difference]: Start difference. First operand 783 states and 6028 transitions. Second operand 11 states. [2019-02-25 15:55:18,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:18,514 INFO L93 Difference]: Finished difference Result 956 states and 7015 transitions. [2019-02-25 15:55:18,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:55:18,515 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:55:18,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:18,522 INFO L225 Difference]: With dead ends: 956 [2019-02-25 15:55:18,522 INFO L226 Difference]: Without dead ends: 954 [2019-02-25 15:55:18,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:18,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-02-25 15:55:18,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 808. [2019-02-25 15:55:18,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-02-25 15:55:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 6214 transitions. [2019-02-25 15:55:18,854 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 6214 transitions. Word has length 6 [2019-02-25 15:55:18,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:18,854 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 6214 transitions. [2019-02-25 15:55:18,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:55:18,854 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 6214 transitions. [2019-02-25 15:55:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:18,856 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:18,856 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:55:18,856 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:18,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:18,856 INFO L82 PathProgramCache]: Analyzing trace with hash 904323940, now seen corresponding path program 2 times [2019-02-25 15:55:18,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:18,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:18,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:18,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:18,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:55:19,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:19,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:19,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:19,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:19,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:19,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:19,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:55:19,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:55:19,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:55:19,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:19,020 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:55:19,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:19,093 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:19,093 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,121 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,136 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,168 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,205 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,252 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,303 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,367 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:19,370 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:19,374 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:19,377 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:19,381 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:19,383 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:19,387 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:55:19,387 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,440 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,471 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,496 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,515 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,531 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,546 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,616 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:19,616 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:55:19,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,649 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:19,649 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,715 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:19,716 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:19,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,756 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:19,756 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,820 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:19,820 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:108, output treesize:78 [2019-02-25 15:55:19,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,857 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 120 [2019-02-25 15:55:19,858 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:19,922 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:19,922 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:88, output treesize:76 [2019-02-25 15:55:19,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:19,965 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:19,965 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:20,027 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:20,028 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-02-25 15:55:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:20,052 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:20,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:20,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:55:20,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:20,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:55:20,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:55:20,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:55:20,117 INFO L87 Difference]: Start difference. First operand 808 states and 6214 transitions. Second operand 11 states. [2019-02-25 15:55:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:21,423 INFO L93 Difference]: Finished difference Result 1087 states and 7943 transitions. [2019-02-25 15:55:21,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:55:21,423 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:55:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:21,428 INFO L225 Difference]: With dead ends: 1087 [2019-02-25 15:55:21,428 INFO L226 Difference]: Without dead ends: 1084 [2019-02-25 15:55:21,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:55:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2019-02-25 15:55:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 849. [2019-02-25 15:55:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-02-25 15:55:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 6541 transitions. [2019-02-25 15:55:21,717 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 6541 transitions. Word has length 6 [2019-02-25 15:55:21,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:21,717 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 6541 transitions. [2019-02-25 15:55:21,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:55:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 6541 transitions. [2019-02-25 15:55:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:21,719 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:21,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:21,719 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash 904327972, now seen corresponding path program 1 times [2019-02-25 15:55:21,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:21,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:21,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:55:21,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:21,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:21,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:21,784 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [32], [33] [2019-02-25 15:55:21,785 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:21,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:22,079 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:22,080 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:55:22,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:22,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:22,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:22,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:22,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:22,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:22,093 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:55:22,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:22,141 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:55:22,141 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,168 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,180 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,197 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,224 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,255 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,291 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:22,294 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:22,297 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:22,301 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:22,305 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:22,308 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:22,317 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:55:22,318 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,364 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,395 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,417 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,435 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,451 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,465 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,515 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:22,516 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:55:22,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,574 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:55:22,574 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,615 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:22,615 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:55:22,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,653 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,654 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:55:22,654 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,696 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:22,697 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:55:22,724 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,727 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,735 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:22,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:55:22,736 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,777 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:22,777 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:55:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:22,803 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:22,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:22,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:55:22,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:22,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:55:22,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:55:22,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:55:22,916 INFO L87 Difference]: Start difference. First operand 849 states and 6541 transitions. Second operand 10 states. [2019-02-25 15:55:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:23,938 INFO L93 Difference]: Finished difference Result 942 states and 6912 transitions. [2019-02-25 15:55:23,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:55:23,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:55:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:23,943 INFO L225 Difference]: With dead ends: 942 [2019-02-25 15:55:23,943 INFO L226 Difference]: Without dead ends: 940 [2019-02-25 15:55:23,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:55:23,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-02-25 15:55:24,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 891. [2019-02-25 15:55:24,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-02-25 15:55:24,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 6849 transitions. [2019-02-25 15:55:24,265 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 6849 transitions. Word has length 6 [2019-02-25 15:55:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:24,265 INFO L480 AbstractCegarLoop]: Abstraction has 891 states and 6849 transitions. [2019-02-25 15:55:24,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:55:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 6849 transitions. [2019-02-25 15:55:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:24,267 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:24,267 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:24,267 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:24,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:24,267 INFO L82 PathProgramCache]: Analyzing trace with hash 904333738, now seen corresponding path program 1 times [2019-02-25 15:55:24,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:24,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:24,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:24,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:24,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:55:24,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:24,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:24,348 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:24,348 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [32], [33] [2019-02-25 15:55:24,349 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:24,349 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:24,637 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:24,638 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:55:24,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:24,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:24,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:24,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:24,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:24,648 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:24,653 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:55:24,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:24,661 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:24,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,665 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:24,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,674 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:24,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,687 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:24,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,697 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,699 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,701 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:24,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,723 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:24,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:24,733 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:55:24,734 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:24,796 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:24,829 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:24,856 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:24,877 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:24,894 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:24,912 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,002 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:55:25,003 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,027 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,040 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,066 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,096 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,137 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,182 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,251 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:25,252 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:55:25,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,292 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:55:25,292 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,359 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:25,360 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:55:25,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,401 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:25,402 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,467 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:25,467 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:55:25,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,503 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,504 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,505 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,510 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,511 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,512 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:25,513 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:55:25,514 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,574 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:25,575 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-25 15:55:25,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:25,600 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:25,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:25,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:55:25,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:25,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:55:25,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:55:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:25,659 INFO L87 Difference]: Start difference. First operand 891 states and 6849 transitions. Second operand 9 states. [2019-02-25 15:55:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:26,800 INFO L93 Difference]: Finished difference Result 959 states and 7083 transitions. [2019-02-25 15:55:26,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:55:26,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:55:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:26,805 INFO L225 Difference]: With dead ends: 959 [2019-02-25 15:55:26,805 INFO L226 Difference]: Without dead ends: 951 [2019-02-25 15:55:26,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-02-25 15:55:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 909. [2019-02-25 15:55:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-02-25 15:55:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 7020 transitions. [2019-02-25 15:55:27,154 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 7020 transitions. Word has length 6 [2019-02-25 15:55:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:27,154 INFO L480 AbstractCegarLoop]: Abstraction has 909 states and 7020 transitions. [2019-02-25 15:55:27,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:55:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 7020 transitions. [2019-02-25 15:55:27,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:27,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:27,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:27,156 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:27,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:27,156 INFO L82 PathProgramCache]: Analyzing trace with hash 904320284, now seen corresponding path program 1 times [2019-02-25 15:55:27,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:27,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:27,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:27,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:27,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:55:27,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:27,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:27,208 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:27,208 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [32], [33] [2019-02-25 15:55:27,209 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:27,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:27,497 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:27,497 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:55:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:27,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:27,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:27,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:27,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:27,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:27,527 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:55:27,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:27,544 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:27,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,583 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:27,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,644 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:27,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,731 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:27,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,837 INFO L292 Elim1Store]: Index analysis took 104 ms [2019-02-25 15:55:27,838 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:27,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:27,966 INFO L292 Elim1Store]: Index analysis took 125 ms [2019-02-25 15:55:27,966 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:28,122 INFO L292 Elim1Store]: Index analysis took 152 ms [2019-02-25 15:55:28,123 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:55:28,123 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,333 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,368 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,392 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,414 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,432 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,448 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,507 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:55:28,508 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,522 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,529 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,544 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,565 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,594 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,644 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:28,644 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:55:28,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,708 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:55:28,709 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,760 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:28,761 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:55:28,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,798 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:55:28,798 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,847 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:28,847 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:55:28,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,895 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:28,895 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:28,896 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:55:28,897 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:28,940 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:28,941 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:55:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:28,968 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:29,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:29,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:55:29,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:29,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:55:29,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:55:29,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:29,029 INFO L87 Difference]: Start difference. First operand 909 states and 7020 transitions. Second operand 9 states. [2019-02-25 15:55:29,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:29,965 INFO L93 Difference]: Finished difference Result 973 states and 7237 transitions. [2019-02-25 15:55:29,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:55:29,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:55:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:29,971 INFO L225 Difference]: With dead ends: 973 [2019-02-25 15:55:29,971 INFO L226 Difference]: Without dead ends: 972 [2019-02-25 15:55:29,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:29,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-02-25 15:55:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 929. [2019-02-25 15:55:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-02-25 15:55:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 7180 transitions. [2019-02-25 15:55:30,334 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 7180 transitions. Word has length 6 [2019-02-25 15:55:30,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:30,334 INFO L480 AbstractCegarLoop]: Abstraction has 929 states and 7180 transitions. [2019-02-25 15:55:30,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:55:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 7180 transitions. [2019-02-25 15:55:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:30,335 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:30,336 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:30,336 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:30,336 INFO L82 PathProgramCache]: Analyzing trace with hash 904792908, now seen corresponding path program 1 times [2019-02-25 15:55:30,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:30,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:30,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:30,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:30,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:30,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:30,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:30,418 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:30,419 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [26], [31] [2019-02-25 15:55:30,419 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:30,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:30,755 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:30,755 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:55:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:30,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:30,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:30,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:30,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:30,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:30,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:30,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:30,847 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:55:30,847 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:30,870 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:30,895 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:30,925 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:30,953 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:30,993 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:31,042 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:31,045 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:31,047 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:31,051 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:31,053 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:31,060 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:55:31,061 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,101 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,131 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,155 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,174 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,189 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,204 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,254 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:31,254 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-25 15:55:31,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,332 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:55:31,333 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,377 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:31,377 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:55:31,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,503 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,504 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,504 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:55:31,505 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,547 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:31,548 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-25 15:55:31,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,593 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:31,594 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:55:31,594 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,639 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:31,639 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:55:31,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,681 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:31,682 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:55:31,683 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,724 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:31,725 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:55:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:33,505 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:33,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:33,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:33,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:55:33,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:33,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:55:33,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:55:33,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:55:33,593 INFO L87 Difference]: Start difference. First operand 929 states and 7180 transitions. Second operand 12 states. [2019-02-25 15:55:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:35,152 INFO L93 Difference]: Finished difference Result 1006 states and 7394 transitions. [2019-02-25 15:55:35,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:55:35,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:55:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:35,157 INFO L225 Difference]: With dead ends: 1006 [2019-02-25 15:55:35,157 INFO L226 Difference]: Without dead ends: 1004 [2019-02-25 15:55:35,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:55:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-02-25 15:55:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 890. [2019-02-25 15:55:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-02-25 15:55:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 6868 transitions. [2019-02-25 15:55:35,525 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 6868 transitions. Word has length 6 [2019-02-25 15:55:35,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:35,525 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 6868 transitions. [2019-02-25 15:55:35,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:55:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 6868 transitions. [2019-02-25 15:55:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:35,527 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:35,527 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:35,528 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:35,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:35,528 INFO L82 PathProgramCache]: Analyzing trace with hash 904808472, now seen corresponding path program 1 times [2019-02-25 15:55:35,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:35,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:35,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:35,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:35,529 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:35,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:35,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:35,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:35,628 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:35,628 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [32], [33] [2019-02-25 15:55:35,629 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:35,629 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:35,904 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:35,904 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:55:35,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:35,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:35,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:35,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:35,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:35,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:35,918 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:55:35,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:35,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:55:35,988 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,013 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,040 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,066 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,103 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,143 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,190 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:36,195 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:36,197 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:36,199 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:36,202 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:36,205 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:36,214 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:55:36,214 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,253 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,283 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,307 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,326 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,342 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,356 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,406 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:36,406 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:55:36,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,469 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:55:36,470 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,515 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:36,515 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:55:36,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,546 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,549 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:55:36,550 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,593 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:36,594 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:55:36,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,623 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,630 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:36,631 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:55:36,631 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,676 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:36,676 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:55:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:36,702 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:36,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:36,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:55:36,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:36,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:55:36,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:55:36,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:55:36,761 INFO L87 Difference]: Start difference. First operand 890 states and 6868 transitions. Second operand 10 states. [2019-02-25 15:55:39,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:39,740 INFO L93 Difference]: Finished difference Result 959 states and 7078 transitions. [2019-02-25 15:55:39,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:55:39,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:55:39,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:39,745 INFO L225 Difference]: With dead ends: 959 [2019-02-25 15:55:39,745 INFO L226 Difference]: Without dead ends: 958 [2019-02-25 15:55:39,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:55:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2019-02-25 15:55:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 910. [2019-02-25 15:55:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-02-25 15:55:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 7028 transitions. [2019-02-25 15:55:40,115 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 7028 transitions. Word has length 6 [2019-02-25 15:55:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:40,116 INFO L480 AbstractCegarLoop]: Abstraction has 910 states and 7028 transitions. [2019-02-25 15:55:40,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:55:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 7028 transitions. [2019-02-25 15:55:40,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:40,118 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:40,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:40,118 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:40,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:40,118 INFO L82 PathProgramCache]: Analyzing trace with hash 904808346, now seen corresponding path program 1 times [2019-02-25 15:55:40,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:40,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:40,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:40,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:40,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:40,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:40,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:40,257 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:40,258 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [28], [31] [2019-02-25 15:55:40,259 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:40,259 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:40,612 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:40,612 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:55:40,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:40,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:40,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:40,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:40,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:40,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:40,628 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:40,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:40,682 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:55:40,682 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,700 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,714 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,732 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,754 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,784 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,824 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:55:40,828 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:55:40,830 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:55:40,832 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:55:40,835 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:55:40,837 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:55:40,848 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:55:40,848 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,886 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,916 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,940 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,959 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,974 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:40,989 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:41,038 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:41,039 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-25 15:55:41,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,099 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:55:41,100 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:55:41,257 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-25 15:55:41,257 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:106, output treesize:150 [2019-02-25 15:55:41,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,341 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 109 [2019-02-25 15:55:41,342 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:41,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,462 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,463 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,466 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,525 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 106 [2019-02-25 15:55:41,526 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-25 15:55:41,702 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2019-02-25 15:55:41,702 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:172, output treesize:177 [2019-02-25 15:55:41,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,790 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:41,803 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:41,813 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 122 [2019-02-25 15:55:41,814 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:55:42,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,133 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:42,133 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 93 [2019-02-25 15:55:42,134 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,294 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:42,295 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 105 [2019-02-25 15:55:42,295 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,443 INFO L301 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 17 dim-0 vars, and 4 xjuncts. [2019-02-25 15:55:42,444 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:207, output treesize:204 [2019-02-25 15:55:42,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,585 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:42,586 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 93 [2019-02-25 15:55:42,587 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,718 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,720 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,721 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,723 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 95 [2019-02-25 15:55:42,723 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,858 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:42,882 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 124 [2019-02-25 15:55:42,885 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2019-02-25 15:55:43,227 INFO L301 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-25 15:55:43,227 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:189, output treesize:310 [2019-02-25 15:55:43,494 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 133 [2019-02-25 15:55:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:43,496 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:43,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:43,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:55:43,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:43,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:55:43,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:55:43,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:43,608 INFO L87 Difference]: Start difference. First operand 910 states and 7028 transitions. Second operand 12 states. [2019-02-25 15:55:43,871 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-02-25 15:55:44,170 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-02-25 15:55:44,553 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-02-25 15:55:48,520 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-25 15:55:48,522 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.io.FileOutputStream.writeBytes(Native Method) at java.io.FileOutputStream.write(FileOutputStream.java:326) 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-02-25 15:55:48,526 INFO L168 Benchmark]: Toolchain (without parser) took 201890.96 ms. Allocated memory was 138.9 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 106.4 MB in the beginning and 357.4 MB in the end (delta: -250.9 MB). Peak memory consumption was 818.6 MB. Max. memory is 7.1 GB. [2019-02-25 15:55:48,526 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:55:48,527 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.99 ms. Allocated memory is still 138.9 MB. Free memory was 106.0 MB in the beginning and 103.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:55:48,527 INFO L168 Benchmark]: Boogie Preprocessor took 25.96 ms. Allocated memory is still 138.9 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-02-25 15:55:48,527 INFO L168 Benchmark]: RCFGBuilder took 543.07 ms. Allocated memory is still 138.9 MB. Free memory was 102.6 MB in the beginning and 90.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-02-25 15:55:48,527 INFO L168 Benchmark]: TraceAbstraction took 201261.53 ms. Allocated memory was 138.9 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 90.1 MB in the beginning and 357.4 MB in the end (delta: -267.2 MB). Peak memory consumption was 802.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:55:48,529 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.21 ms. Allocated memory is still 138.9 MB. Free memory is still 107.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.99 ms. Allocated memory is still 138.9 MB. Free memory was 106.0 MB in the beginning and 103.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.96 ms. Allocated memory is still 138.9 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 543.07 ms. Allocated memory is still 138.9 MB. Free memory was 102.6 MB in the beginning and 90.1 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 201261.53 ms. Allocated memory was 138.9 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 90.1 MB in the beginning and 357.4 MB in the end (delta: -267.2 MB). Peak memory consumption was 802.3 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...